#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <utility>
#include <iterator>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <deque>
#include <bitset>
#include <complex>
#include <iomanip>
#include <random>
#include <assert.h>
#include <unordered_set>
#include <unordered_map>

using namespace std;

#define pb push_back
#define f first
#define s second
#define mp make_pair
#define endl '\n'
#define SZ(x) ((int)(x.size()))
#define FOI(i, a, n) for(int i = int(a); i <= int(n); i++)
#define FOD(i, a, n) for(int i = int(a); i >= int(n); i--)
#define IN(x, y) ((y).find(x) != (y).end())
#define ALL(t) t.begin(),t.end()
#define MSET(tabl,i) memset(tabl, i, sizeof(tabl))
#define PSET(x,y) fixed<<setprecision(y)<<lf(x)
#define DBG(c) cout << #c << " = " << c << endl;
#define RTIME ((double)clock()/(double)CLOCKS_PER_SEC)
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

typedef long long ll;
typedef long double lf;
typedef pair < int, int > ii;
typedef pair < ll, ll > pll;
typedef vector < int > vi;
typedef vector<vi> vvi;
typedef complex<double> base;

const int NMAX = 2e5+4;
const ll MOD = 1e9 + 7;
const lf pi = 3.141592653589793238462643383;
const int IMAX = 2e9;

template<class T>
using max_pq = priority_queue<T>;
template<class T>
using min_pq = priority_queue<T,vector<T>,greater<T>>;

//y is the inverse and a is modulus and define x & y
ll x,y;
template<class T> T gcd(T a,T b){ if(a==0) {x=0,y=1; return b;}T gc=gcd(b%a,a);T temp;temp=x;x=y-(b/a)*temp;y=temp;return gc;}
//(a^x)%m
ll po(ll a, ll x,ll m){ if(x==0){return 1;}ll ans=1;ll k=1;  while(k<=x) {if(x&k){ans=((ans*a)%m);} k<<=1; a*=a; a%=m; }return ans; }

pll pop[NMAX];
int st[NMAX];
ll r1[NMAX];
pair<ii,int> clou[NMAX];

vector<pair<ii,ll> > events;


int main()
{
    sync
    int n;
    cin>>n;
    FOI(i,0,n-1)
    cin>>pop[i].s;
    FOI(i,0,n-1)
    {
        cin>>pop[i].f;
        events.pb({{pop[i].f,1},pop[i].s});
    }
    int m;
    cin>>m;
    FOI(i,1,m)
    cin>>st[i];
    FOI(i,1,m)
    {
        int r;
        cin>>r;
        events.pb({{st[i]-r,0},i});
        events.pb({{st[i]+r,2},i});
    }
    sort(events.begin(),events.end());
    set<int> en;
    int cn = 0;
    ll ans= 0;
    for(auto u:events)
    {
        
        if(u.f.s==0)
        {
            cn++;
            en.insert((int)u.s);
        }
        else if(u.f.s==1)
        {
            if(cn==0)
                ans+= u.s;
            else if(cn==1)
            {
                r1[(int)*(en.begin())] += u.s;
            }
        }
        else
        {
            cn--;
            en.erase((int)u.s);
        }
    }
    ll ma = 0;
    FOI(i,1,m)
    ma = max(ma,r1[i]);
    ans += ma;
    cout<<ans<<endl;
}