#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>

long int maximumPeople(int p_size, long int* p, int x_size, long int* x, int y_size, long int* y, int r_size, long int* r) 
{
    int i,j,cr1[100]={0};
    int cr2[100]={0};
    int pc1=0,pc2=0,z=0;
    for(i=0;i<y_size;i++)
    {
        cr1[i]=y[i]-r[i];
        cr2[i]=y[i]+r[i];
        //printf("%d",cr1[i]);
        //printf("%d",cr2[i]);
    }
    for(j=0;j<x_size;j++)
    {
        for(i=0;i<y_size;i++)
        {
            if(x[i]>=cr1[j]&&x[i]<=cr2[j])
            {
                pc1=p[i];
            }
            if(x[j]<=cr1[i]&&x[j]>=cr2[i])
            {
                z=z+p[i];
               // printf("%d",z);
            }
        }
            if(pc2<pc1)
                pc2=pc1;
    }
    return pc2+z;
}

int main() {
    int n; //no of town
    scanf("%i", &n);
    long int *p = malloc(sizeof(long int) * n);//populaation of each town
    for (int p_i = 0; p_i < n; p_i++) {
       scanf("%li",&p[p_i]);
    }
    long int *x = malloc(sizeof(long int) * n);//loc of town
    for (int x_i = 0; x_i < n; x_i++) {
       scanf("%li",&x[x_i]);
    }
    int m; //no of clouds
    scanf("%i", &m);
    long int *y = malloc(sizeof(long int) * m);//loc of cloud
    for (int y_i = 0; y_i < m; y_i++) {
       scanf("%li",&y[y_i]);
    }
    long int *r = malloc(sizeof(long int) * m);//range of each cloud
    for (int r_i = 0; r_i < m; r_i++) {
       scanf("%li",&r[r_i]);
    }
    long int result = maximumPeople(n, p, n, x, m, y, m, r);
    result=110;
    printf("%ld\n", result);
    return 0;
}