#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */  
    int i,j,n,m,s=0,full=0;
    vector< pair<int,int> > lim;
    pair<int,int>pr;
    cin>>n;
    int p[n],x[n];
    for(i=0; i<n; i++)
    {
        cin>>p[i];
    }
    for(i=0; i<n; i++)
    {
        cin>>x[i];
        if(x[i]>full)
            full=x[i];
    }
    cin>>m;
    int y[m],r[m];
    for(i=0; i<m; i++)
    {
        cin>>y[i];
    }
    for(i=0; i<m; i++)
    {
        cin>>r[i];
    }
    for(i=0; i<m; i++)
    {
        if((y[i]-r[i])>=0)
            pr.first=y[i]-r[i];
        else
            pr.first=0;
        if((y[i]+r[i])<=full)
            pr.second=y[i]+r[i];
        else
            pr.second=full;
        lim.push_back(pr);
    }
    for(i=0; i<n; i++)
    {
        for(j=0; j<m; j++)
        {
            if((x[i]>(lim[j].first))&&(x[i]<(lim[j].second)))
            {
                p[i]=0;
            }
        }
    }
    for(i=0; i<n; i++)
    {
        s=s+p[i];
    }
    cout<<s<<endl;
    return 0;
}