import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;


public class Solution {

    static long maximumPeople(long[] cityPop, long[] cityLoc, long[] cloudLoc, long[] cloudRange, boolean[] covered) {

        long maxPop = 0;
        for(int i=0; i<cloudLoc.length; i++) {
            
            long cloudPop = 0;
            int rmin = (int) (cloudLoc[i] - cloudRange[i] - 1);
            int rmax = (int) (cloudLoc[i] + cloudRange[i] - 1);
            
            for(int j = rmin; j<=rmax; j++) {
                if(j >= 0 && j < cityLoc.length) {
                    cloudPop += cityPop[j];
                    covered[j] = true;
                }
            }
            
            if(cloudPop > maxPop) {
                maxPop = cloudPop;
            }
            
        }
        long maxSum = 0;
        for(int i=0; i<cityPop.length; i++) {
            if(covered[i] == false) {
                maxSum += cityPop[i];
            }
        }
        return maxSum+maxPop;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        long[] p = new long[n];
        boolean[] covered = new boolean[n];
        
        // population
        for(int p_i = 0; p_i < n; p_i++){
            p[p_i] = in.nextLong();
        }
        
        // city location
        long[] x = new long[n];
        for(int x_i = 0; x_i < n; x_i++){
            x[x_i] = in.nextLong();
        }
        // no. of clouds
        int m = in.nextInt();
        
        // location of cloud
        long[] y = new long[m];
        for(int y_i = 0; y_i < m; y_i++){
            y[y_i] = in.nextLong();
        }
        
        // range of every cloud
        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,covered);
        System.out.println(result);
        in.close();
    }
}