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

using namespace std;

int pop[200001], locOr[200001], no;
int nn, locN[200001], raza[200001];
int apO[200001] = {0}, sum = 0;

int main() {
    cin >> no;
    for(int i = 1; i <= no; i++)
        cin >> pop[i];
    for(int i = 1; i <= no; i++)
        cin >> locOr[i];
    cin >> nn;
    for(int i = 1; i <= nn; i++)
        cin >> locN[i];
    for(int i = 1; i <= nn; i++)
        cin >> raza[i];
    
    if(nn == 1){
        for(int i = 1; i <= no; i++)
            sum += pop[i];
        cout << sum;
    }
    else{
        for(int i = 1; i <= nn; i++){
            int dxmin = locN[i] - raza[i];
            int dxmax = locN[i] + raza[i];
            for(int j = 1; j <= no; j++){
                if(dxmin <= locOr[j] && locOr[j] <= dxmax)
                    sum += pop[j];
            }

        }
    }
    
    
}