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 s=0;
        long a=0;
        long t[]=new long[p.length];
        long q[]=new long[r.length+y.length];
        for(int i=0;i<q.length-1;i++)
        {
            q[i]=y[i]+r[i];
            q[i+1]=y[i]-r[i];
        }
        for(int i=0;i<x.length;i++)
        {
            for(int j=0;j<q.length;j++)
            {
                if(q[i]==x[i])
                {
                    t[i]=p[i];
                }
                else if(q[i]!=x[i])
                {
                    t[i]=p[i];
                }
            }
        }
        
        for(int i=0;i<t.length;i++)
        {
            s=s+t[i];
        }
        return s;
    }

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