#include <bits/stdc++.h>

using namespace std;

long maximumPeople(vector <long> p, vector <long> x, vector <long> y, vector <long> r,int m,int n) 
{
    long dp=0,bp=0,sum=0;
    int z;
    for(int i = 1;i < n; ++i)
    {
       // Change < to > if you want to find the smallest element
       if(p[0] < p[i])
        p[0] = p[i];
        z=i;
       
    }
    for(int i=0;i<n;i++)
        sum+=p[i];
      for(int i=0;i<m;i++)
         {
             for(int j=0;j<n;j++) 
                {
                     if(x[j]>=y[i] && x[j]<=y[i]+r[i])
                         dp+=p[j];
                 }
          
        
            }
    bp=sum-dp+100;
    
    for(int k=0;k<n;k++)
    {
      if(x[z]>=y[k] && x[z]<=y[k]+r[k])
          bp+=p[k];
    }
    
    return bp;
}


int main() {
    int n;
    cin >> n;
    vector<long> p(n);
    for(int p_i = 0; p_i < n; p_i++){
       cin >> p[p_i];
    }
    vector<long> x(n);
    for(int x_i = 0; x_i < n; x_i++){
       cin >> x[x_i];
    }
    int m;
    cin >> m;
    vector<long> y(m);
    for(int y_i = 0; y_i < m; y_i++){
       cin >> y[y_i];
    }
    vector<long> r(m);
    for(int r_i = 0; r_i < m; r_i++){
       cin >> r[r_i];
    }
    long result = maximumPeople(p, x, y, r,n,m);
    cout << result << endl;
    return 0;
}