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


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */  
    int i,j,n,m,temp,mm = -1;
    cin>>n;
    int p[n+1],x[n+1];
    for(i = 1;i < n+1;i++)
    {
        cin>>temp;
        p[i] = temp;
    }
    for(i = 1;i < n+1;i++)
    {
        cin>>temp;
        if(temp > mm)
            mm = temp;
        x[i] = temp;
    }
    cin>>m;
    int y[m+1],r[m+1];
    for(i = 1;i < m+1;i++)
    {
        cin>>temp;
        y[i] = temp;
    }
    for(i = 1;i < m+1;i++)
    {
        cin>>temp;
        r[i] = temp;
    }
    int arr[mm+1] = {0};
    for(i = 1;i < m+1;i++)
    {
        for(j = y[i] - r[i]; j <= y[i] + r[i];j++)
            arr[j] += 1;
    }
    map<int,int> a;
    for(i = 1;i < n+1;i++)
    {
        a.insert(pair <int,int> (x[i],p[i]));
    }
    int ans = 0,mp = -1;
    
    for(i = 1;i < mm+1;i++)
    {
        if(arr[i] == 0)
        {
            if(a.find(i) != a.end())
                ans += a[i];
        }
        else
            if(arr[i] == 1)
            {
                if(a.find(i) != a.end())
                {
                    if(mp < a[i])
                        mp = a[i];
                }
            }
    }
    ans += mp;
    cout<<ans;
    return 0;
}