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, int m, int n) {
        // Return the maximum number of people that will be in a sunny town after removing exactly one cloud.
        long max = 0;
        boolean[] cloud_city = new boolean[n];
        for(int i=0; i<m; i++){
            long range_begin = y[i] - r[i];
            long range_end = y[i] + r[i];
            //System.out.println("rb: "+range_begin+" re: "+range_end);
            long temp_pop = 0;
            for(int j=0; j<n; j++){
                if(x[j] >= range_begin && x[j] <= range_end){
                    cloud_city[j] = true;
                    temp_pop += p[j];
                    //System.out.println("temp: "+temp_pop);
                }
            }
            if(temp_pop > max){
                max = temp_pop;
            }
        }
        long pop_sum = 0;
        for(int i = 0; i<n; i++){
            if(!cloud_city[i]){
                pop_sum += p[i];
            }
        }
        return pop_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, m, n);
        System.out.println(result);
        in.close();
    }
}