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

public class Solution {

    static int maximumPeople(int[] p, int[] x, int[] y, int[] r) {
        // Return the maximum number of people that will be in a sunny town after removing exactly one cloud.
    int maxpeople=0;
        int max=Integer.MIN_VALUE;
        int min=Integer.MAX_VALUE;
        for(int i=0;i<y.length;i++){
            int cov=y[i];
            int cov1=y[i]-r[i];
            int cov2=y[i]+r[i];
            if(max<cov2){
                max=cov2;
            }
            if(min>cov1){min=cov1;}   
        }
        for(int j=0;j<p.length;j++){
            
            
                if(x[j]>=min&&x[j]<=max){
                maxpeople=maxpeople+p[j];
          }
            else if(x[j]>max||x[j]<min){
                maxpeople=maxpeople+p[j];
            }
        }
        return maxpeople;
    
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] p = new int[n];
        for(int p_i = 0; p_i < n; p_i++){
            p[p_i] = in.nextInt();
        }
        int[] x = new int[n];
        for(int x_i = 0; x_i < n; x_i++){
            x[x_i] = in.nextInt();
        }
        int m = in.nextInt();
        int[] y = new int[m];
        for(int y_i = 0; y_i < m; y_i++){
            y[y_i] = in.nextInt();
        }
        int[] r = new int[m];
        for(int r_i = 0; r_i < m; r_i++){
            r[r_i] = in.nextInt();
        }
        int result = maximumPeople(p, x, y, r);
        System.out.println(result);
        in.close();
    }
}