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. // p is population of towns // x is location of towns // y is location of clouds // r is range of clouds long currentSum = 0; long maxPeople = 0; boolean[] CUC = new boolean[p.length]; //System.out.println(CUC[0]); long[][] range = new long[y.length][2]; for(int i = 0 ; i < y.length ; i++){ range[i][0] = y[i] - r[i]; range[i][1] = y[i] + r[i]; for(int j = 0 ; j < x.length ; j++){ if(x[j] <= range[i][1] && x[j] >= range[i][0] ){ currentSum += p[j]; CUC[j] = true; //System.out.println(currentSum); if(currentSum > maxPeople){ maxPeople = currentSum; } } } } for(int j = 0 ; j < x.length ; j++){ if(!CUC[j]){ maxPeople += p[j]; } } return maxPeople; } 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(); } }