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

struct town
{
    int p;
    int x;
};
struct cloud
{
    int y;
    int r;
};
bool acompare1(town lhs,town rhs)
{
    return (lhs.p>rhs.p);
}
bool acompare2(cloud lhs,cloud rhs)
{
    return (lhs.y<rhs.y);
}
int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int n,m,res=0;
    int flag1=0,flag2=0;
    cin>>n;
    struct town t[n];
    for(int i=0;i<n;i++)
    {
        cin>>t[i].p;
    }
    for(int i=0;i<n;i++)
    {
        cin>>t[i].x;
    }
    sort(t,t+n,acompare1);
    cin>>m;
    struct cloud c[m];
    for(int i=0;i<m;i++)
    {
        cin>>c[i].y;
    }
    for(int i=0;i<m;i++)
    {
        cin>>c[i].r;
    }
    sort(c,c+m,acompare2);
    vector<int> minn;
    vector<int> maxx;
    for(int i=0;i<m;i++)
    {
        if(c[i].y-c[i].r>=0)
            minn.push_back(c[i].y-c[i].r);
        else
            minn.push_back(0);
        maxx.push_back(c[i].y+c[i].r);
    }
    for(int i=0;i<n;i++)
    {
        //flag2=0;
        for(int j=0;j<m;j++)
        {
            if(t[i].x<minn[0])
            {
                res+=t[i].p;
                break;
            }
            else if(t[i].x>=minn[j] && t[i].x<=maxx[j])
            {
                if(flag1==0)
                {
                    flag1=1;    
                    res+=t[i].p;
                }
                else
                    break;
            }
            else
            {
                res+=t[i].p;
                break;
            }
        }
    }
    cout<<res;
    return 0;
}