#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) {
    // Return the maximum number of people that will be in a sunny town after removing exactly one cloud.
    long int i,j,k,max=0,sum,start,end;
    long int *mark = calloc(1,sizeof(long int) * p_size);
        for (i=0;i<y_size;i++){
            start=y[i]-r[i];
            end=y[i]+r[i];
                        sum=0;
            for (j=0;j<x_size;j++){
                if (x[j]>=start && x[j] <= end){
                    sum+=p[j];
                    mark[j]=1;
                }
            }
            for (k=0;k<p_size;k++){
                if (mark[k] == 0){
                    sum+=p[k];
                }
            }
            if (max<sum){
              max=sum;  
            } 
        }
    return max;
}

int main() {
    int n; 
    scanf("%i", &n);
    long int *p = malloc(sizeof(long int) * n);
    for (int p_i = 0; p_i < n; p_i++) {
       scanf("%li",&p[p_i]);
    }
    long int *x = malloc(sizeof(long int) * n);
    for (int x_i = 0; x_i < n; x_i++) {
       scanf("%li",&x[x_i]);
    }
    int m; 
    scanf("%i", &m);
    long int *y = malloc(sizeof(long int) * m);
    for (int y_i = 0; y_i < m; y_i++) {
       scanf("%li",&y[y_i]);
    }
    long int *r = malloc(sizeof(long int) * m);
    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);
    printf("%ld\n", result);
    return 0;
}