#include <bits/stdc++.h>

using namespace std;
bool sotcol(vector<long> &v1,vector<long> &v2)
{
    return v1[0]<v2[0];
}
long maximumPeople(vector <long> p, vector <long> x, vector <long> y, vector <long> r,vector< vector<long> > range,int n,int m) {
    // Return the maximum number of people that will be in a sunny town after removing exactly one cloud.\
    
    vector< vector<long> > pos(n,vector<long>(2));
    
    vector<long> counting(n);
    for(int i=0;i<n;i++)
        counting[i]=0;
    for(int i=0;i<n;i++)
    {
        pos[i][0]=x[i];
        pos[i][1]=i;
    }
    sort(pos.begin(),pos.end(),sotcol);
    int k=0;
    for(int i=0;i<n&&k<m;i++)
    {
        while(1)
        {
            if(range[k][1]>pos[i][0])
            { k++;
             continue;}
            else
               break;
            if(k>=m)
                break;
        }
        if(k<m&&(range[k][0]<=pos[i][0]&&range[k][1]>=pos[i][0]))
            counting[pos[i][1]]=1;
        //cout<<pos[i][0]<<" "<<range[k][0]<<" "<<range[k][1]<<" "<<counting[pos[i][1]]<<endl;
    }
    long kk=0;
    for(int i=0;i<n;i++)
    {
        if(counting[i]==1&&p[i]>kk)
        {
         kk=p[i];   
        }
    }
   // long ret=kk;
    
    //for(int i=0;i<n;i++)
        //cout<<counting[i]<<" ";
    for(int i=0;i<n;i++)
        if(counting[i]==0)
            kk+=p[i];
   // cout<<endl;
    return kk;
    
}

int main() {
    int n;
    cin >> n;
    vector<long> p(n);
    for(int p_i = 0; p_i < n; p_i++){
       cin >> p[p_i];
    }
    vector<long> x(n);
    for(int x_i = 0; x_i < n; x_i++){
       cin >> x[x_i];
    }
    int m;
    cin >> m;
    vector<long> y(m);
    for(int y_i = 0; y_i < m; y_i++){
       cin >> y[y_i];
    }
    vector<long> r(m);
    for(int r_i = 0; r_i < m; r_i++){
       cin >> r[r_i];
    }
    vector< vector<long> > range(m,vector<long>(2));
    for(int i=0;i<m;i++)
    {
        range[i][0]=y[i]-r[i];
        range[i][1]=y[i]+r[i];
    }
    sort(range.begin(),range.end(),sotcol);
    long result = maximumPeople(p, x, y, r,range,n,m);
    cout << result << endl;
    return 0;
}