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

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