#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 a=0,b,c,d=0;
    int e[p_size];
    for(int k=0;k<p_size;k++)
    {
        e[k]=0;
    }
    for(int i=0;i<r_size;i++)
    {
        for(int j=0;j<p_size;j++)
        {
            if(e[j]==0)
            {
                if(x[j]<(y[i]-r[i])|| x[j]>(y[i]+r[i]))
                    e[j]=0;
                else
                    e[j]=1;
            }
        }
    }
    for(int i=0;i<r_size;i++)
    {
        b=y[i]+r[i]-(y[i]-r[i]);
            if(b>=a)
            {
                a=b;
                c=i;
            }
                
    }
    for(int i=0;i<p_size;i++)
    {
        if(x[i]>=(y[c]-r[c])&&x[i]<=(y[c]+r[c]))
            d=d+p[i];
    }
    for(int k=0;k<p_size;k++)
    {
        if(e[k]==0)
            d=d+p[k];
    }
    return d;
}

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;
}