#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define inf 1000000000000
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define S second
#define F first
#define boost1 ios::sync_with_stdio(false);
#define boost2 cin.tie(0);
#define ict int t;scanf("%d",&t);while(t--)

int main()
{
	
   	ll nc,nd,sum=0;
   	//nd = no of colude;

   	cin>>nc;
   	int cp[nc];for(int i=0;i<nc;i++)cin>>cp[i],sum+=cp[i];
   	int cl[nc];for(int i=0;i<nc;i++)cin>>cl[i];
   	cin>>nd;
   	int ld[nd];for(int i=0;i<nd;i++)cin>>ld[i];
   	int rd[nd];for(int i=0;i<nd;i++)cin>>rd[i];
  	
  	int as=*max_element(cl,cl+nc);
  	int arr[as+1]={0};

  	for(int i=0;i<nc;i++)
  	arr[cl[i]]=cp[i];

  	ll fp=-1,tp=0,up;
  	for(int i=0;i<nd;i++)
  	{
  		int loc=ld[i];
  		int range=rd[i];

  		for(int j=loc-range;j<=loc+range;j++)
  		{
  			tp+=arr[j];
  		}

  		if(fp<tp)
  		fp=tp,up=loc;
  		tp=0;
  	}
 
 

  	for(int i=0;i<nd;i++)
  	{
  		int loc=ld[i];
  		int range=rd[i];

  		for(int j=loc-range;j<=loc+range;j++)
  		{
  			arr[j]=-12345;
  		}		
  	}

  	ll ans=0;
  	for(int i=0;i<=as;i++)
  	if(arr[i]!=-12345)
  	ans+=arr[i];

  
  	cout<<ans+fp<<endl;

}