#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <cstring>

using namespace std;
int pop_town[200005],loc_town[200005];


int main() {
    int n ;
    cin >> n ;
        memset(pop_town,0,sizeof(pop_town));
        memset(loc_town,0,sizeof(loc_town));
        //map<int,pair<int,int>>;
        for(int i=0;i<n;i++) cin >>pop_town[i];
        for(int i=0;i<n;i++) cin >>loc_town[i];
        int m;
        cin >> m;
        int loc[m];
        for(int i=0;i<m;i++) cin >> loc[i];
        int range[m];
        for(int i=0;i<m;i++) cin >> range[i];
        int ans[m];
        int alr=0;
        memset(ans,0,sizeof(ans));
        for(int i=0;i<m;i++)
        {
            int a =loc[i]-range[i];
            int b =loc[i]+range[i];
            for(int j=0;j<n;j++) 
            {
                int p = loc_town[j];
                int q = pop_town[j];
                if(p>=a && p<=b) ans[i]+=q;
                else alr+=q; 
            }
        }
        
        //for(int i=0;i<m;i++) cout <<"dg="<<ans[i]<<"\n";
    int maxo =-99999999;
    for(int i=0;i<m;i++) if(ans[i]>maxo) maxo=ans[i];
    cout <<maxo+alr;
    
}