#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
/*ll lowerIndex(vector<ll> &arr, ll n, ll x)
{
    int l = 0, h = n - 1;
    while (l <= h) {
        int mid = (l + h) / 2;
        if (arr[mid] >= x)
            h = mid - 1;
        else
            l = mid + 1;
    }
    return l;
}

// function to find last index <= y
ll upperIndex(vector<ll> &arr, ll n, ll x)
{
    int l = 0, h = n - 1;
    while (l <= h) {
        int mid = (l + h) / 2;
        if (arr[mid] <= y)
            l = mid + 1;
        else
            h = mid - 1;
    }
    return h;
}*/
int main()
{
    ll n;
    cin>>n;
    ll tp=0;
    vector<ll> P(n,0);
    vector<ll> X(n,0);
    vector<ll> sump(n,0);
    for(ll i=0;i<n;i++)
    {
        cin>>P[i];
        tp+=P[i];
    }
    for(ll i=0;i<n;i++)
    {
        cin>>X[i];
    }
    sump[0]=P[0];
    for(ll i=1;i<n;i++)
    {
        sump[i]=sump[i-1]+P[i];
    }
    ll m;
    cin>>m;
    vector<ll> Y(m,0);
    vector<ll> R(m,0);
    for(ll i=0;i<m;i++)
    {
        cin>>Y[i];
    }
    for(ll i=0;i<m;i++)
    {
        cin>>R[i];
    }
    if(m==1)
    {
        cout<<tp<<endl;
        return 0;
    }
    /*ll minp=-10000000000;
    //ll tcp=0;
    ll all_low=n-1;
    ll all_high=0;
    for(ll i=0;i<m;i++)
    {
        ll temp=0;
        ll low=Y[i]-R[i];
        ll high=Y[i]+R[i];
        ll lower=lowerIndex(X,n,low);
        ll higher=upperIndex(X,n,high);
        if(lower!=0)
        {
            temp=sump[higher]-sump[lower-1];
        }
        else
        {
            temp=sump[higher];
        }
        if(temp>minp)
        {
            minp=temp;
        }
    }
    */
    return 0;
}