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) {
       
        long[] ypop = new long[y.length];
        boolean camein = false;
        long total=0;
        for(int j=0;j<x.length;j++){
            for(int i=0;i<y.length;i++){
                if((y[i]+r[i]>=x[j]&&x[i]>=y[i])||(y[i]-r[i]<=x[j] && x[i]<=y[i])){
                    ypop[i] +=p[j];
                    camein=true;
                }
               
            }
            if(!camein){
                total +=p[j];
                
            }
            camein=false;
        }
        long max=0;
        for(int i=0;i<ypop.length;i++){
            if(ypop[i]>max){
                max=ypop[i];
            }
        }
        total+=max;
        return total;

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