#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 m, n;
    cin >> n;
    int p[n], x[n];
    for(int i=0; i<n; i++)
        cin >> p[i];
    for(int i=0; i<n; i++)
        cin >> x[i];
    cin >> m;
    int y[n], r[n];
    for(int i=0; i<m; i++)
        cin >> y[i];
    for(int i=0; i<m; i++)
        cin >> r[i];
    
    int cPop[m], sunny = 0, max;
    for(int i=0; i<m; i++)
        cPop[i] = 0;
    for(int i=0; i<m; i++)
    {
        for(int j=0; j<n; j++)
        {
            if(x[j] >= y[i]-r[i] && x[j] <= y[i]+r[i])
                cPop[i] = cPop[i] + p[j];
            else
                sunny = sunny + p[j];
        }
    }
    max = cPop[0];
    for(int i=1; i<m; i++)
        if(max < cPop[i])
            max = cPop[i];
    printf("%d", max+sunny);
    return 0;
}