#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#define N 100001
#define M 1000000
#define K 350
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int n,m,r,sz,szt,szt2,num[N+1],num2[N+1],p[N+1],q[N+1],a[N+1],lst[N+1],block[N+1],blocks[N+1],blocks2[N+1],blocks3[N+1],ft[K+1],ed[K+1],ft2[K+1],ed2[K+1],pv[N+1],nt[N+1];
unsigned int tans,delta[N+1],delta2[N+1],b[N+1],A[K+1][K+1],B[K+1][K+1],C[K+1][K+1],D[K+1][K+1],E[N+1],F[K+1],G[N+1],H[K+1],ans[M+1];
struct reads
{
	int l1,r1,l2,r2,num;
	bool operator < (const reads &t)const
	{
		return block[l1]!=block[t.l1]?block[l1]<block[t.l1]:r1>t.r1;	
	}
};
reads st[M+1];
inline void adder(int l,int r,unsigned int ds,int d)
{
	if (l==1)
	{
		E[r]+=ds,F[blocks3[r]]+=ds;
		return;
	}
	if (r==n)
	{
		G[l]+=ds,H[blocks3[l]]+=ds;
		return;
	}
	if (d==1) num[l]=r,num2[r]=l,delta[l]=delta2[r]=ds;
	else num[l]=delta[l]=num2[r]=delta2[r]=0;
	A[blocks[l]][blocks[r]]+=ds,B[blocks[l]][blocks2[r]]+=ds,C[blocks2[l]][blocks[r]]+=ds,D[blocks2[l]][blocks2[r]]+=ds;
	return;
}
unsigned int query(int l,int r)
{
	unsigned int res=0;
	for (int i=r;i<=min(blocks3[r]*szt2,n);++i) res+=E[i];
	for (int i=blocks3[r]+1;i<=blocks3[n];++i) res+=F[i];
	for (int i=(blocks3[l]-1)*szt2+1;i<=l;++i) res+=G[i];
	for (int i=1;i<=blocks3[l]-1;++i) res+=H[i];
	for (int i=1;i<=blocks[l]-1;++i)
	{
		for (int j=blocks[r]+1;j<=blocks[n];++j) res+=A[i][j];
		for (int j=blocks2[r]+1;j<=ed[blocks[r]];++j) res+=B[i][j];
	}
	for (int i=ft[blocks[l]];i<=blocks2[l]-1;++i)
	{
		for (int j=blocks[r]+1;j<=blocks[n];++j) res+=C[i][j];
		for (int j=blocks2[r]+1;j<=ed[blocks[r]];++j) res+=D[i][j];
	}
	for (int i=ft2[blocks2[l]];i<=l;++i)
		if (num[i]&&num[i]>=r)
			res+=delta[i];
	for (int i=r;i<=ed2[blocks2[r]];++i)
		if (num2[i]&&num2[i]<=ft2[blocks2[l]]-1)
			res+=delta2[i];
	return res;
}
int main()
{
    int s1,s2;
	n=read();
	for (int i=1;i<=n;++i) p[i]=read(),q[p[i]]=i;
	for (int i=1;i<=n;++i) a[i]=read();
	for (int i=1;i<=n;++i) b[i]=read(),tans+=b[i];
	m=read();
	for (int i=1;i<=m;++i) st[i].l1=read(),st[i].r1=read(),st[i].l2=read(),st[i].r2=read(),st[i].num=i;
	sz=max((int)(n/max((int)(sqrt(m)),1)),1),szt=max((int)(pow(n,0.75)),1),szt2=max((int)(sqrt(n)),1);
	for (int i=1;i<=n;++i) block[i]=(i-1)/sz+1,blocks[i]=(i-1)/szt+1,blocks3[i]=(i-1)/szt2+1;
	for (int i=1;i<=blocks[n];++i)
	{
		blocks2[(i-1)*szt+1]=blocks2[(i-1)*szt]+1;
		for (int j=(i-1)*szt+1;j<=min(i*szt,n)-1;++j) blocks2[j+1]=blocks2[j]+((j-(i-1)*szt)%szt2==0);
	}
	for (int i=1;i<=blocks[n];++i) ft[i]=blocks2[(i-1)*szt+1],ed[i]=blocks2[min(i*szt,n)];
	for (int i=1;i<=n;++i)
	{
		if (!ft2[blocks2[i]]) ft2[blocks2[i]]=i;
		ed2[blocks2[i]]=i;
	}
	sort(st+1,st+m+1);
	for (int i=1;i<=m;++i)
	{
		if (block[st[i].l1]!=block[st[i-1].l1])
		{
			for (int j=1;j<=n;++j) lst[j]=pv[j]=num[j]=delta[j]=num2[j]=delta2[j]=0,nt[j]=n+1;
			for (int j=1;j<=K;++j)
				for (int t=1;t<=K;++t)
					A[j][t]=B[j][t]=C[j][t]=D[j][t]=0;
			for (int j=1;j<=n;++j) E[j]=G[j]=0;
			for (int j=1;j<=K;++j) F[j]=H[j]=0;
			for (int j=1;j<=n;++j)
				if ((block[st[i].l1]-1)*sz+1<=q[j]&&q[j]<=st[i].r1)
					pv[j]=lst[a[q[j]]],lst[a[q[j]]]=j;
			for (int j=1;j<=n;++j) lst[j]=n+1;
			for (int j=n;j>=1;--j)
				if ((block[st[i].l1]-1)*sz+1<=q[j]&&q[j]<=st[i].r1)
					nt[j]=lst[a[q[j]]],lst[a[q[j]]]=j;
			for (int j=1;j<=n;++j)
				if ((block[st[i].l1]-1)*sz+1<=q[j]&&q[j]<=st[i].r1)
				{
					if (pv[j]+1<=j-1) adder(pv[j]+1,j-1,b[a[q[j]]],1);
					if (nt[j]==n+1&&j+1<=n) adder(j+1,n,b[a[q[j]]],1);
				}
			for (int j=1;j<=n;++j)
				if (lst[j]==n+1)
					adder(1,n,b[j],1);
			r=st[i].r1;
		}
		while (r>st[i].r1)
		{
			s1=pv[p[r]],s2=nt[p[r]];
			if (s1+1<=p[r]-1) adder(s1+1,p[r]-1,-b[a[r]],-1);
			if (p[r]+1<=s2-1) adder(p[r]+1,s2-1,-b[a[r]],-1);
			if (s1+1<=s2-1) adder(s1+1,s2-1,b[a[r]],1);
			nt[s1]=s2,pv[s2]=s1,r--;
		}
		for (int j=(block[st[i].l1]-1)*sz+1;j<=st[i].l1-1;++j)
		{
			s1=pv[p[j]],s2=nt[p[j]];
			if (s1+1<=p[j]-1) adder(s1+1,p[j]-1,-b[a[j]],-1);
			if (p[j]+1<=s2-1) adder(p[j]+1,s2-1,-b[a[j]],-1);
			if (s1+1<=s2-1) adder(s1+1,s2-1,b[a[j]],1);
			nt[s1]=s2,pv[s2]=s1;
		}
		ans[st[i].num]=tans-query(st[i].l2,st[i].r2);
		for (int j=st[i].l1-1;j>=(block[st[i].l1]-1)*sz+1;--j)
		{
			s1=pv[p[j]],s2=nt[p[j]];
			if (s1+1<=s2-1) adder(s1+1,s2-1,-b[a[j]],-1);
			if (s1+1<=p[j]-1) adder(s1+1,p[j]-1,b[a[j]],1);
			if (p[j]+1<=s2-1) adder(p[j]+1,s2-1,b[a[j]],1);
			nt[s1]=pv[s2]=p[j];
		}
	}
	for (int i=1;i<=m;++i) printf("%u\n",ans[i]);
	return 0;
}