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 t) {
 int min,max=0;long pop=0;int i,j=0;   
        for(i=0;i<t;i++)
        {
            min=(int)(y[i]-r[i]);max=(int)(y[i]+r[i]);
         for(j=min;j<=max;j++)
         { if(j==x[i])
             {
                pop+=p[i];  }
             }
            
            pop=pop+p[++i];
         }
       return pop;
    }
        // Return the maximum number of people that will be in a sunny town after removing exactly one cloud.
    

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