#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int n;
    cin>>n;
    int population[n]={0};
    int position[n]={0};
    int k;
    int banda=0;
    for(int i=0;i<n;i++){cin>>k;population[k]++;banda=banda+k;}
    for(int j=0;j<n;j++){cin>>k;position[k]++;}
    int bandi=0;
    int m;
    cin>>m;
    int cp[m];
    for(int i=0;i<m;i++){
        cin>>cp[i];
    }
    int cr[m];
        for(int j=0;j<m;j++){
            cin>>cr[j];
        }
    int max=0;
    int res;
            for(int i=0;i<m;i++){
                      int p=0;
                p=cp[i];
                    int range=cr[i];
                        int a,b;
                a=p-range;b=p+range;
                int count=0;
                
                
                int pop2,count1=0;
                        for(int x=a;x<=b;x++){
                            if(x>=0){
                                if(position[x]>0){
                                    count++;
                                    count1=count1+population[x];
                                    bandi=bandi+population[x];
                                }
                            }
                        }
                if(count>max){max=count;res=count1;
                             }
                count=0;
                count1=0;
            }
    banda=banda-bandi+res;
    cout<<banda<<endl;
    return 0;
          
}