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,int n,int m) { long pop=0,max=0;
     if(m==1 || m==0)
     {
      for(int i=0;i<n;i++)
          pop=p[i]+pop;
       return(pop); 
     }
     else
     {
     for(int i=0;i<m;i++)
     {
      long a=y[i]+r[i];
      long b=y[i]-r[i];
      for(int j=0;j<n;j++)
       {
        if(x[j]>=b && x[j]<=a) 
         {
          if(p[j]>max)
              max=p[j];
         } 
         else
           pop=pop+p[j];
       }
     }
     pop=pop+max;    
     return(pop);
                   
     } 
    }

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