#include <bits/stdc++.h>
#define ll long long 
#define mod 1000000007
using namespace std;
inline int read()
{int x=0,f=0;
char c=getchar();
while (c<'0'||c>'9') 
{if (c=='-') f=1;
c=getchar();
}
while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
if (f) x=-x;
return x;
}
int a[200005],n,m;
int lf[100005],rg[100005];
ll s[200005];
struct towns
{int p,x;
}t[200005];
struct cloud
{int y,r;
}p[100005];
inline bool cmp(towns a,towns b)
{return a.x<b.x;}
int main (){
	int i,j,k;
	n=read();
	for (i=1;i<=n;i++) t[i].p=read();
	for (i=1;i<=n;i++) t[i].x=read();
	sort(t+1,t+n+1,cmp);
	m=read();
	for (i=1;i<=m;i++) p[i].y=read();
	for (i=1;i<=m;i++) p[i].r=read();
	for (i=1;i<=m;i++)
	{int l=1,r=n;
	while (l<=r)
	{int mid=(l+r)>>1;
	if (t[mid].x<p[i].y-p[i].r) {l=mid+1;}
	else {r=mid-1;}
	}
	lf[i]=l;
	l=1;r=n;
	while (l<=r)
	{int mid=(l+r)>>1;
	if (t[mid].x>p[i].y+p[i].r) {r=mid-1;}
	else {l=mid+1;}
	}
	rg[i]=r;
	a[lf[i]]++;
	a[rg[i]+1]--;
	}
	ll ans=0;
	for (i=1;i<=n;i++)
	{a[i]+=a[i-1];s[i]=s[i-1];
	if (a[i]==0) ans+=t[i].p;
	if (a[i]==1) s[i]+=t[i].p;
	}
	ll maxn=0;
	for (i=1;i<=m;i++)
	{maxn=max(maxn,s[rg[i]]-s[lf[i]-1]);}
	ans+=maxn;
	printf ("%lld\n",ans);
	return 0;
}