import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    static long maximumPeople(long[] p, long[] x, long[] y, long[] r) {
        // Return the maximum number of people that will be in a sunny town after removing exactly one cloud.
        long populationCloud[] = new long[y.length];
        long cloudPerCity[] = new long[x.length];
        long maxCloud[] = new long[y.length];
        long maxPopulation=0;
        for(int i=0;i<y.length;i++)
        {
            populationCloud[i]=0;    
        }
        for(int i=0;i<x.length;i++)
        {
            for(int j=0;j<y.length;j++)
            {
                if(x[i] > (y[j] - r[j]) && x[i] < (y[j] - r[j]))
                {
                    cloudPerCity[i]++;
                    populationCloud[j] += p[i];
                }
            }
        }
        for(int i=0;i<x.length;i++)
        {
            if(cloudPerCity[i] == 0)
            {
                maxPopulation += p[i];
            }
        }
        for(int i=0;i<x.length;i++)
        {
            for(int j=0;j<y.length;j++)
            {
                if(x[i] > (y[j] - r[j]) && x[i] < (y[j] - r[j]) && cloudPerCity[i] > 1)
                {
                    populationCloud[j] -= p[i];
                }
            }
        }
        long number = populationCloud[0];
        for(int i=1;i<populationCloud.length;i++)
        {
            if(number < populationCloud[i])
                number = populationCloud[i];
        }
        return number + maxPopulation;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        long[] p = new long[n];
        for(int p_i = 0; p_i < n; p_i++){
            p[p_i] = in.nextLong();
        }
        long[] x = new long[n];
        for(int x_i = 0; x_i < n; x_i++){
            x[x_i] = in.nextLong();
        }
        int m = in.nextInt();
        long[] y = new long[m];
        for(int y_i = 0; y_i < m; y_i++){
            y[y_i] = in.nextLong();
        }
        long[] r = new long[m];
        for(int r_i = 0; r_i < m; r_i++){
            r[r_i] = in.nextLong();
        }
        long result = maximumPeople(p, x, y, r);
        System.out.println(result);
        in.close();
    }
}