#include <bits/stdc++.h>
#include <unordered_map>

//#include <ext/pb_ds/assoc_container.hpp> // Common file
//#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update

#define rep(i,n) for(i=1;i<=n;i++)
#define Rep(i,n) for(i=0;i<n;i++)
#define For(i,a,b) for(i=a;i<=b;i++)

#define pb(x) push_back(x)
#define sz(x) (int)x.size()

#define mem(ara,val) memset(ara,val,sizeof(ara))
#define eps 1e-9

#define si(x) scanf("%d",&x)
#define sii(x,y) scanf("%d %d",&x,&y)
#define siii(x,y,z) scanf("%d %d %d",&x,&y,&z)
#define sl(x) scanf("%lld",&x)
#define sll(x,y) scanf("%lld %lld",&x,&y)
#define slll(x,y,z) scanf("%lld %lld %lld",&x,&y,&z)
#define ss(str) scanf("%s",str)
#define pi(x) printf("%d",x)
#define pii(x,y) printf("%d %d",x,y)
#define piii(x,y,z) printf("%d %d %d",x,y,z)
#define pl(x) printf("%lld",x)
#define pll(x,y) printf("%lld %lld",x,y)
#define plll(x,y,z) printf("%lld %lld %lld",x,y,z)
#define NL printf("\n")
#define Max 200005
#define INF 1e9
#define un(x) x.erase(unique( x.begin() , x.end() ), x.end())
#define mod 1000000007

#define FI freopen("in.txt","r",stdin)

#define D(x) cout << #x << " = " << x << endl
#define DD(x,y) cout << #x << " = " << x << "   " << #y << " = " << y << endl
#define DDD(x,y,z) cout << #x << " = " << x << "   " << #y << " = " << y << "   " << #z << " = " << z << endl

typedef long long LL;
typedef unsigned long long ULL;

using namespace std;

int setb(int n,int pos)
{
    return n=n | (1 << pos);
}
int resb(int n,int pos)
{
    return n=n & ~(1 << pos);
}
bool checkb(int n,int pos)
{
    return (bool)(n & (1 << pos));
}

LL bigmod(LL b,LL p,LL m)
{
    if( p == 0 ) return 1;
    LL ret = bigmod(b,p/2,m);
    ret = ( ret * ret ) % m;
    if( p & 1 ) ret = ( ret * b ) % m;
    return ret;
}

LL n,m,ara[Max][2],cloud[Max][2];

struct town
{
    LL x,val;
    town() {}
    town(LL x,LL val): x(x) , val(val) {}
    bool operator < ( const town &p ) const
    {
        return x < p.x;
    }
};
town t[Max];

struct info
{
    LL x,y;
    info() {}
    info(LL x,LL y): x(x), y(y) {}
};
info c[Max];

LL a[Max],sum[Max];

LL cl,cr;
void cloud_range(LL x,LL y)
{
    LL low = 1, high = n, mid, ans = -1;
    ///lft
    while( low <= high )
    {
        mid = (low + high) / 2;
        LL my = t[mid].x;
        if( my >= x )
        {
            ans = mid;
            high = mid - 1;
        }
        else low = mid + 1;
    }
    LL l = ans;
    low = 1, high = n, ans = -1;
    ///rgt
    while( low <= high )
    {
        mid = (low + high) / 2;
        LL my = t[mid].x;
        if( my <= y )
        {
            ans = mid;
            low = mid + 1;
        }
        else high = mid - 1;
    }
    LL r = ans;
    cl = l;
    cr = r;
}

void put_cloud(LL x,LL y)
{
    cloud_range(x,y);
    LL l = cl;
    LL r = cr;
    if( l != -1 && l != -1 && l <= r )
    {
        a[r]++;
        a[l-1]--;
    }
}

LL oh[Max];
void prework()
{
    LL i;
    rep(i,n) t[i] = town(ara[i][0],ara[i][1]);
    sort(t+1,t+n+1);
    rep(i,m) c[i] = info(cloud[i][0]-cloud[i][1],cloud[i][0]+cloud[i][1]);
    rep(i,m)
    {
        put_cloud(c[i].x,c[i].y);
    }
    int cur = 0;
    for(i=n;i>=1;i--)
    {
        cur += a[i];
        sum[i] = cur;
    }
    rep(i,n)
    {
        oh[i] = oh[i-1];
        if( sum[i] == 0 ) continue;
        if( sum[i] > 1 ) continue;
        oh[i] += t[i].val;
    }
}

void solve()
{
    LL i,ret = 0;
    rep(i,n) if( sum[i] == 0 ) ret += t[i].val;
    LL mx = 0;
    rep(i,m)
    {
        cloud_range(c[i].x,c[i].y);
        LL l = cl; LL r = cr;
        if( l != -1 && r != -1 && l <= r )
        {
            LL here = oh[r] - oh[l-1];
            mx = max( here , mx );
        }
    }
    ret += mx;
    pl(ret); NL;
}

int main()
{
    //FI;
    LL i;
    sl(n);
    rep(i,n) sl(ara[i][1]);
    rep(i,n) sl(ara[i][0]);
    sl(m);
    rep(i,m) sl(cloud[i][0]);
    rep(i,m) sl(cloud[i][1]);
    prework();
    solve();
    return 0;
}