#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#define N 100000
#define M 1000000
using namespace std;
long long read()
{
	char c=0;
	long long 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,sz,l1,r1,l2,r2,block[N+1],p[N+1],q[N+1],C[N+1],Cs[N+1],cnt[N+1];
unsigned int W[N+1],Wt[N+1],Ws[N+1],res,ans[M+1];
struct reads
{
	int x1,y1,x2,y2,num;
	bool operator < (const reads &t)const
	{
		if (block[x1]!=block[t.x1]) return block[x1]<block[t.x1];
		else if (block[y1]!=block[t.y1]) return block[y1]<block[t.y1];
		else if (block[x2]!=block[t.x2]) return block[x2]<block[t.x2];
		else return y2<t.y2;
	}
};
reads st[M+1];
int main()
{
	n=read(),sz=max(n/max((int)(pow(m,1.0/4)),1),1);
	for (int i=1;i<=n;++i) block[i]=(i-1)/sz+1;
	for (int i=1;i<=n;++i) p[i]=read(),q[p[i]]=i;
	for (int i=1;i<=n;++i) C[i]=read();
	for (int i=1;i<=n;++i) W[i]=read();
	for (int i=1;i<=n;++i) Cs[i]=C[q[i]],Wt[i]=W[C[i]],Ws[i]=W[Cs[i]];
	m=read();
	for (int i=1;i<=m;++i) st[i].x1=read(),st[i].x2=read(),st[i].y1=read(),st[i].y2=read(),st[i].num=i;
	sort(st+1,st+m+1),l1=l2=1,r1=r2=0;
	for (int i=1;i<=m;++i)
	{
		while (l1>st[i].x1)
		{
			--l1;
			if (l2<=p[l1]&&p[l1]<=r2) cnt[C[l1]]++,res+=(cnt[C[l1]]==1)?Wt[l1]:0;
		}
		while (r1<st[i].x2)
		{
			++r1;
			if (l2<=p[r1]&&p[r1]<=r2) cnt[C[r1]]++,res+=(cnt[C[r1]]==1)?Wt[r1]:0;
		}
		while (l1<st[i].x1)
		{
			if (l2<=p[l1]&&p[l1]<=r2) cnt[C[l1]]--,res-=(!cnt[C[l1]])?Wt[l1]:0;
			++l1;
		}
		while (r1>st[i].x2)
		{
			if (l2<=p[r1]&&p[r1]<=r2) cnt[C[r1]]--,res-=(!cnt[C[r1]])?Wt[r1]:0;
			--r1;
		}
		while (l2>st[i].y1)
		{
			--l2;
			if (l1<=q[l2]&&q[l2]<=r1) cnt[Cs[l2]]++,res+=(cnt[Cs[l2]]==1)?Ws[l2]:0;
		}
		while (r2<st[i].y2)
		{
			++r2;
			if (l1<=q[r2]&&q[r2]<=r1) cnt[Cs[r2]]++,res+=(cnt[Cs[r2]]==1)?Ws[r2]:0;
		}
		while (l2<st[i].y1)
		{
			if (l1<=q[l2]&&q[l2]<=r1) cnt[Cs[l2]]--,res-=(!cnt[Cs[l2]])?Ws[l2]:0;
			++l2;
		}
		while (r2>st[i].y2)
		{
			if (l1<=q[r2]&&q[r2]<=r1) cnt[Cs[r2]]--,res-=(!cnt[Cs[r2]])?Ws[r2]:0;
			--r2;
		}
		ans[st[i].num]=res;
	}
	for (int i=1;i<=m;++i) printf("%u\n",ans[i]);
	return 0;
}