#include <bits/stdc++.h>
using namespace std;

//map<int, pair<int, int>> M;
map<int, int> M;

int n, m;


int main() 
{
    cin >> n;    
    
    vector<int> pop(n);
    vector<int> loc(n);
    
    int L, R = 0;
    int ans = 0, total = 0;
    
    
    for(int i=0; i<n; i++)
    {
        cin >> pop[i];
        total += pop[i];
    }
    for(int i=0; i<n; i++)
    {
        cin >> loc[i];        

        M[loc[i]] = i;
        R = max(R, loc[i]);
    }    
    cin >> m;
    
    vector<int> pos(m);
    vector<int> range(m);        
        
    for(int i=0; i<m; i++)
    {
        cin >> pos[i];
        R = max(R, 0);
    }
    vector<int> covered(R+10, 0);
    vector<vector<int>> C(m);
    
    for(int i=0; i<m; i++)
    {
        cin >> range[i];
        
        for(int j=pos[i]-range[i]; j<=pos[i]+range[i]; j++)
        {            
            covered[j]++;
            
            if(M.count(j))
            {
                total -= pop[M[j]];
                C[i].push_back(j);
            }
        }
    }
    cerr << total << endl;
   
    int maxDiff = 0;
    
    for(int i=0; i<m; i++)
    {        
        if(!C[i].empty())
        {
            int diff = 0;                
            
            for(auto town : C[i])
            {
                if(covered[town] == 1) 
                {
                    diff += pop[M[town]];
                }
            }
            if(diff > maxDiff)
            {
                maxDiff = diff;
                ans = total + diff;
            }
        }
    }    
    cout << ans << endl;
    /*
    for(auto it : M)
    {
        int position = it.first, 
            town = it.second;

        if(covered[position])
        {
            total -= pop[town];
        }
    }
    */


    return 0;
}