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 l = y.length;
        int u = x.length;
        long affected = 0;
        int[] ar = new int[u];
        for( int i = 0; i < y.length; i++ )
        {  long min = y[i] - r[i];
           long max = y[i] + r[i];
            for( int j = 0 ; j < x.length; j++ )
             {
                  if( x[j] >= min && x[j] <= max )
                      {
                           affected += x[j];
                           ar[j] = 1;
                      }
             }
                  
        }
        Arrays.sort(x);
        for( int k = 0; k < u; k++ )
        {
            if( ar[k] == 1 )
            {
                affected = (affected - x[k]);
                break;
            }
        }
        return affected;    
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        long sum = 0;
        long[] p = new long[n];
        for(int p_i = 0; p_i < n; p_i++){
            p[p_i] = in.nextLong();
            sum+= p[p_i];
        }
        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(sum - result);
        in.close();
    }
}