#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pr;
const int mod=998244353,D=300000;
const ll inf=1e18;
struct Query{
	int x,id;
};
int n,q,a[600005],b[600005],s[600005],pos[600005],vst[600005],used[600005];
int isused[600005];
ll sum[600005],ans[1000005],mns[600005],_ans[600005],_occ[600005],prea[600005];
vector<int> occ[300005];
vector<Query> largeq[300005];
int p1=2000000,p2=0;
char buf[2000005],wbuf[2000005];
int gc(){
	if(p1>=2000000)fread(buf,1,2000000,stdin),p1=0;
	return buf[p1++];
}
int rd(){
	int x=0,ff=1;
	char ch=gc();
	while((ch<'0'||ch>'9')&&ch!='-')ch=gc();
	if(ch=='-')ff=-1,ch=gc();
	while(ch<='9'&&ch>='0')x=x*10+ch-'0',ch=gc();
	return x*ff;
}
void pc(char x){
	if(p2==2000000)fwrite(wbuf,1,p2,stdout),p2=0;
	wbuf[p2++]=x;
}
void wrt(ll x){
	if(x<0)return pc('-'),wrt(-x);
	if(!x)return pc('0');
	int t[20]={0};
	while(x)t[++t[0]]=x%10,x/=10;
	while(t[0])pc(t[t[0]--]+'0');
}
int main(){
	n=rd(),q=rd();
	const int B=max((int)sqrt(n),10);
	for(int i=1;i<=n;i++)a[i]=rd(),occ[a[i]].push_back(i);
	for(int i=1;i<=n;i++)b[i]=rd();
	for(int i=1,x,y;i<=q;i++){
		x=rd(),y=rd();
		if(occ[x].size()>occ[y].size())swap(x,y);
		largeq[y].push_back({x,i}),ans[i]=-inf;
	}
	fill(mns,mns+D+D+1,inf);
	for(int i=1;i<=n;i++){
		if(!largeq[i].size())continue;
		if(occ[i].size()>B){
			for(int j=1;j<=n;j++){
				s[j]=s[j-1]+(a[j]==i),sum[j]=sum[j-1]+(a[j]==i?b[j]:0),vst[j]=0;
				if(a[j]==i)_occ[s[j]]=j;
			}
			for(Query j:largeq[i]){
				int x=j.x;
				if(vst[x]){
					ans[j.id]=_ans[x];
					continue;
				}
				int lst=0;
				for(int k:occ[x])prea[k]=prea[lst]+b[k],lst=k;
				vst[x]=1,_ans[x]=-inf,used[0]=0;
				int L=-s[n]+(int)occ[x].size(),R=L,curs=L;
				lst=n+1;
				//反着来 
				for(int p=occ[x].size()-1;p>=0;p--){
					int k=occ[x][p];
					//printf("backward:%d\n",k);
					int o=s[lst-1]-s[k],t=s[lst-1];
					while(o&&curs+1<=R){
						curs++,t--,o--;
						mns[curs+D]=sum[_occ[t]]+prea[k];
						if(!isused[curs+D])used[++used[0]]=curs+D,isused[curs+D]=1;
					}
					curs+=o,R=max(R,curs),curs--,lst=k;
					if(curs<L){
						L=curs;
						continue;
					}
					mns[curs+D]=sum[k]+prea[k]-b[k];
					//cout<<"B:"<<curs<<' '<<mns[curs+D]<<'\n';
					if(!isused[curs+D])used[++used[0]]=curs+D,isused[curs+D]=1;
				}
				int o=s[lst-1],t=s[lst-1];
				while(o&&curs+1<=R){
					curs++,t--,o--;
					mns[curs+D]=sum[_occ[t]];
					if(!isused[curs+D])used[++used[0]]=curs+D,isused[curs+D]=1;
				}
				L=0,R=0,lst=0,curs=0; 
				//正着来 
				for(int k:occ[x]){
					int o=s[k]-s[lst],t=s[lst];
					while(o&&curs-1>=L){
						curs--,t++,o--;
						_ans[x]=max(_ans[x],sum[_occ[t]]+prea[lst]-mns[curs+D]);
						mns[curs+D]=min(mns[curs+D],sum[_occ[t]]+prea[lst]);
						assert(isused[curs+D]);
					}
					curs-=o,L=min(L,curs),curs++,lst=k;
					if(curs>R){
						R=curs;
						continue;
					}
					_ans[x]=max(_ans[x],sum[k]+prea[k]-mns[curs+D]);
					//printf("B %d %lld %lld\n",curs,sum[k]+prea[k],mns[curs+D]);
					mns[curs+D]=min(mns[curs+D],sum[k]+prea[k]);
					assert(isused[curs+D]);
				}
				o=s[n]-s[lst],t=s[lst];
				while(o&&curs-1>=L){
					curs--,t++,o--;
					_ans[x]=max(_ans[x],sum[_occ[t]]+prea[lst]-mns[curs+D]);
					mns[curs+D]=min(mns[curs+D],sum[_occ[t]]+prea[lst]);
					assert(isused[curs+D]);
				}
				for(int i=1;i<=used[0];i++){
					isused[used[i]]=0;
					mns[used[i]]=inf;
				}
				used[0]=0;
				ans[j.id]=_ans[x];
			}
		}
		else {
			for(Query j:largeq[i]){
				int x=j.x,s1=occ[x].size(),s2=occ[i].size();
				int p=0,q=0,s=0,L=0,R=0;
				ll sum=0;
				mns[D]=0;
				while(p<s1||q<s2){
					int o;
					if(q==s2||(p<s1&&q<s2&&occ[x][p]<occ[i][q]))o=occ[x][p++],s++;
					else o=occ[i][q++],s--;
					sum+=b[o],L=min(L,s),R=max(R,s);
					ans[j.id]=max(ans[j.id],sum-mns[s+D]);
					mns[s+D]=min(mns[s+D],sum);
				}
				fill(mns+L+D,mns+R+D+1,inf);
			}
		}
	}
	for(int i=1;i<=q;i++)wrt(ans[i]),pc('\n');
	fwrite(wbuf,1,p2,stdout);
}