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.
        		int length = p.length;
		int c_length = y.length;
		
		
		long maxP = 0;
		long counter = 0 ;
		
		for(int i = 0; i<c_length; i++) {
			
			long cloudPos = y[i];
			long cloudRange = r[i];
			
			for(int j = 0; j<length; j++) {
				if(inRange(cloudPos,cloudRange,p[j])) {
					if(x[j] > maxP) {
						maxP = x[j];
					}
				} else {
					counter += p[j];
				}
			}
			
		
		}
		
		
		return maxP + counter;
    }
    
    
	static boolean inRange(long c_lo, long c_range, long town_loc) {
		long min_range = c_lo - c_range;
		long max_range = c_lo + c_range;
		if(town_loc >= min_range &&   town_loc<=max_range) {
			return true;
		}
		return false;
		
	}

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