#include <bits/stdc++.h>
using namespace std;

int func(long int pop[],long int loc_town[],long int loc_cloud[],long int rang_cloud[],int n,int m ){
        int index=loc_town[0];
       int i, j;
    long int key,key1;
     for (i = 1; i < n; i++)
   {
       key = pop[i];
        key1=loc_town[i];
       j = i-1;
 
       /* Move elements of arr[0..i-1], that are
          greater than key, to one position ahead
          of their current position */
       while (j >= 0 && pop[j] > key)
       {
           pop[j+1] = pop[j];
           loc_town[j+1]=loc_town[j];
           j = j-1;
       }
       pop[j+1] = key;
         loc_town[j+1]=key1;
   }
   long  int max1=0;
    for(int j=n-1;j>0;j--){
        for(int i=0;i<m;i++){
            if((loc_cloud[i]+rang_cloud[i] ) > loc_town[j] && (loc_cloud[i]-rang_cloud[i])<index){
                max1=pop[j];
                break;
            }
        } 
            
        }
        return max1;
}

int main() {
     
    int n;
    cin>>n;
    long int pop[n],tot=0;
    for(int i=0;i<n;i++){
            cin>>pop[i];
            tot+=pop[i];}
    long int loc_town[n];
    for(int i=0;i<n;i++)
            cin>>loc_town[i];
    int m;
    cin>>m;
    long int loc_cloud[m],rang_cloud[m];
    for(int i=0;i<m;i++){
        cin>>loc_cloud[i];
    }
    for(int i=0;i<m;i++){
        cin>>rang_cloud[i];
    }
    //cout<<tot<<endl;
        cout<<(tot-func(pop,loc_town,loc_cloud,rang_cloud,n,m));
   
    return 0;
}