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

public class Solution {
    static boolean inRange(long x, long[] y, long[] r) {
        for (int i = 0; i < y.length; i++) {
            if ((x >= y[i] - r[i]) && (x <= y[i] + r[i])) {

                return true;
            }

        }
        return false;

    }

    static long maximumPeople(long[] p, long[] x, long[] y, long[] r) {
        long max = p[0];
        long totalPeople = 0;
        
        for(int i=0;i< x.length;i++){
            if(!inRange(x[i], y, r)){
                totalPeople+=p[i];
            }else{
                max = Math.max(p[i], totalPeople);
            }
            
        }
        totalPeople=max+totalPeople;
        return totalPeople;
    }

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