#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.
    // *p = population and *x is location of town and y_size is number of cloud covering and *y = location of cloud and *r = range of cloud
    int i;
    int j;
    int max = 0; //max people affected
    long int new[p_size];
    for(i=0;i<p_size;i++)
        new[i] = p[i];
    for(i = 0; i < y_size; i++)  // number of clouds iteration
    {
        int localMax = 0; // for removing that particular cloud
        int a = y[i] - r[i]; //lower range
        int b = y[i] + r[i]; //upper range
        int k = 0;  
        for(j = x[0]; j <= x[x_size-1]; j++)
        {
            if(j>=a && j<=b)
            {
                localMax += p[k];
                new[k] = -1;
            }
            k++;
        }
        if(localMax>max)
            max = localMax;
    }
    for(i=0;i<p_size;i++)
    {
        if(new[i]!=-1)
            max+=p[i];
    }
     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;
}