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 n = p.length;
        int m = y.length;
        long s = 0;
        long sum = 0 , max = 0;
        long arr[] = new long[m];
        for(int i = 0; i<n ; i++)
        {
            s = 0;
            for(int j = 0; j<m; j++)
            {
                if(y[j]-r[j] <= x[i] && x[i] <= y[j]+r[j])
                {
                    s = 10;
                    arr[j]=  arr[j] + p[i];
                }
                
            }
            if(s==0)
                sum =  sum + p[i] ;
        }
        for(int i =0; i<m ; i++)
        {
            if(max<arr[i])
                max = arr[i];
        }
        return sum + max ;
    }

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