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

public class Solution {

    static long maximumPeople(int n, int m, 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 result = 0;
        long[] lb = new long[m];
        long[] ub = new long[m];
        for(int i=0;i<m;i++)
        {
            long tlb = y[i]-r[i];
            long tub = y[i]+r[i];
            if(tlb<0)
                lb[i] = 0;
            else
                lb[i] = tlb;
            if(tub>1000000000)
                ub[i] = 1000000000;
            else
                ub[i] = tub;
        }
        for(int i=0;i<m;i++)
            for(int j=0;j<n;j++)
            {
                boolean flag = true;
                for(int k=0;k<m;k++)
                {
                    if(k==i)
                        continue;
                    if(x[j]>=[k] && x[j]<=ub[k])
                    {
                       flag = false;
                       break;
                    }
                }
                if(flag==true)
                    result += p[j];
            }
        return result;
    }

    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(n, m, p, x, y, r);
        System.out.println(result);
        in.close();
    }
}