#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main() {
	int n;
	scanf("%d", &n);
	ll p[n];
	for(int i = 0; i < n; i++) {
		scanf("%lld", &p[i]);	
	}
	ll x[n];
	for(int i = 0; i < n; i++) {
		scanf("%lld", &x[i]);	
	}
	int m;
	scanf("%d", &m);
	ll y[m], r[m];
	for(int i = 0; i < m; i++) {
		scanf("%lld", &y[i]);	
	}
	ll max = -1, pos = -1;
	for(int i = 0; i < m; i++) {
		scanf("%lld", &r[i]);	
		if(max < r[i]) {
			max = r[i];
            pos = i;
        }
	}
	ll ranges = y[pos] - max;
    ll rangee = y[pos] + max;
    ll count = 0;
    for(int i = 0; i < n; i++) {
        if(x[i] >= ranges && x[i] <= rangee) {
            count += p[i];
        }
    }
    printf("%lld\n", count);
}