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 maxVal= 0;
        boolean[] cloud = new boolean[x.length];
        for(int i=0;i<y.length;i++){
           long value = y[i];
           for(int j=0;j<r.length;j++){
               long rangeMin = y[i]-r[j];
               long rangeMax = y[i]+r[j];
               
               
               for(int l =0;l<x.length;l++){
                   if(rangeMin<=x[l]&&x[l]<=rangeMax){
                       cloud[l] = true;
                   }
                   else{
                      maxVal+=x[l]; 
                   }
               }
               
           }
       }
       long maxPeople= Long.MIN_VALUE; 
       for(int k=0;k<x.length;k++){
           if(cloud[k]==true){
             maxPeople = Math.max(maxPeople,p[k]);
               
           }    
       }
       maxVal+=maxPeople; 
       return maxVal; 
        
    }

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