#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* pp, int x_size, long int* x, int y_size, long int* y, int r_size, long int* r) {
    int i;long int cloud[1000];
    int j;long int n=p_size,pol[1000],o=0,sum=0,max=0;
    int temp;long int m=x_size;
    for(i=0;i<n;i++)
    {
        cloud[i]=0;
        //int p=y[i]-r[i];
        //int q=y[i]+r[i];
        for(j=0;j<m;j++)
        {
            int p=y[j]-r[j];
            int q=y[j]+r[j];
        if(x[i]>=p&&x[i]<=q)
        {
            cloud[i]++;break;
        }
        }if(cloud[i]==1)
        {
            if(o==0)
            {
                max=pp[i];
            }else
            {
                if(max<pp[i])
                {
                    max=pp[i];
                }
            }
            o++;
        }else
        {
            sum=sum+pp[i];
        }
    }return max+sum;// Return the maximum number of people that will be in a sunny town after removing exactly one cloud.
}

int main() {
    int n; 
    scanf("%d", &n);
    long int *p = malloc(sizeof(long int) * n);
    for (int p_i = 0; p_i < n; p_i++) {
       scanf("%ld",&p[p_i]);
    }
    long int *x = malloc(sizeof(long int) * n);
    for (int x_i = 0; x_i < n; x_i++) {
       scanf("%ld",&x[x_i]);
    }
    int m; 
    scanf("%d", &m);
    long int *y = malloc(sizeof(long int) * m);
    for (int y_i = 0; y_i < m; y_i++) {
       scanf("%ld",&y[y_i]);
    }
    long int *r = malloc(sizeof(long int) * m);
    for (int r_i = 0; r_i < m; r_i++) {
       scanf("%ld",&r[r_i]);
    }
    long int result = maximumPeople(n, p, n, x, m, y, m, r);
    printf("%ld\n", result);
    return 0;
}