#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 n,i,j,max=0;
    cin>>n;
    unsigned long int ans=0;
    int p[n]={0};
    int lnew[100000]={0};
    int lcity[n]={0};
    for(i=0;i<n;i++)
    {  
        cin>>p[i];
    }
    for(i=0;i<n;i++)
    { 
        cin>>lcity[i];
        lnew[lcity[i]]=1;
    }
    int m;
    cin>>m;
    int lc[m]={0};
    for(i=0;i<m;i++)
    {
        cin>>lc[i];
    }
    int range[m]={0};
    for(i=0;i<m;i++)
        cin>>range[i];
    int x;
   for(i=0;i<m;i++)
   {
       for(j=lc[i];j<=(lc[i]+range[i]);j++)
       {
            if(lnew[j]==1)
            {
                lnew[j]=0;
            }
        }
       for(j=lc[i];j>=(lc[i]-range[i]);j--)
       {
            if(lnew[j]==1)
            {
                lnew[j]=0;
            }
       }
   }
    for(i=0;i<n;i++)
    {
        x=lcity[i];
        if(lnew[x]==1)
        {
            ans=ans+p[i];
        }
    }
   for(i=0;i<n;i++)
   {
       x=lcity[i];
       if(lnew[x]==0)
       {
           if(p[i]>max)
               max=p[i];
       }
           
   }
   ans=ans+max;
    cout<<ans;
    
    return 0;
}