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 arr[] = new long[p.length];
        for (int i=0;i<arr.length;i++)
            arr[i]=0;
        for (int i=0;i<y.length;i++) {
            for (int j=0;j<x.length;j++) {
                if (Math.abs(x[j]-y[i])<=r[i]) {
                    arr[j]=-p[j];
                }
            }
        }
        long min=arr[0];
        for (int i=1;i<arr.length;i++)
            if (min>arr[i]) {
                min =arr[i];
            }
        long ans=0;
        for (int i=0;i<p.length;i++) {
            ans+=p[i]+arr[i];
        }
        ans-=min;
        return ans;
    }

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