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[] dark = new long[y.length];
        
        long sunny = 0l;
        
        boolean sunnyFlag = true;
        
        for(int j = 0; j < x.length; j++){
        
            sunnyFlag = true;
            
            for(int i = 0; i < y.length; i++){
            
                if((y[i]-r[i]) <= x[j] && x[j] <= (y[i]+r[i])){
                
                    sunnyFlag = false;
                }
            }
            
            if(sunnyFlag){
            
                sunny = sunny + p[j];
            }
        }
        
        for(int i = 0; i < y.length; i++){
        
            dark[i] = 0l;
            
            for(int j = 0; j < x.length; j++){
            
                if((y[i]-r[i]) <= x[j] && x[j] <= (y[i]+r[i])){
                
                    dark[i] = dark[i] + p[j];
                }
            }
        }
        
        Arrays.sort(dark);
        
        return dark[(dark.length-1)] + sunny;
    }

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