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[] darkness = new long[y.length]; int i,j; for(i = 0; i < y.length; i++) { darkness[i] = y[i] + r[i]; } long total = 0; long maxSoFar = 0; boolean[][] dark = new boolean[x.length][y.length]; for(j = 0; j < darkness.length; j++) { for(i = 0; i < x.length; i++) { if(x[i] >= -1 * darkness[j] && x[i] <= darkness[j]) { total += p[i]; dark[i][j] = true; } } maxSoFar = Math.max(maxSoFar,total); } for(j = 0; j < darkness.length; j++) { for(i = 0; i < x.length; i++) { if(dark[i][j] == false) { maxSoFar += p[i]; } } } return maxSoFar; } 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(); } }