#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1000005;
int n,m,q,x,y,z,v[N];
struct Tree{
	int rt,dfn[N],dep[N],fa[N][20],f[N];
	ll d[N];vector<int>e[N];
	int lca(int x,int y){
		if (dep[x]<dep[y])swap(x,y);
		for(int i=19;i>=0;i--)
			if (dep[fa[x][i]]>=dep[y])x=fa[x][i];
		if (x==y)return x;
		for(int i=19;i>=0;i--)
			if (fa[x][i]!=fa[y][i])x=fa[x][i],y=fa[y][i];
		return fa[x][0];
	}
	void dfs(int k,int f,int s){
		dfn[k]=++dfn[0],dep[k]=s,fa[k][0]=f;
		for(int i=1;i<20;i++)fa[k][i]=fa[fa[k][i-1]][i-1];
		for(int i:e[k])dfs(i,k,s+1);
	}
	int find(int k){
		if (k==f[k])return k;
		int F=find(f[k]);d[k]+=d[f[k]];return f[k]=F;
	}
	void merge(int x,int y,int z){
		int x0=find(x),y0=find(y);
		if (x0!=y0)f[y0]=x0,d[y0]=d[x]-d[y]+z;
	}
	void read(){
		for(int i=1;i<=n;i++){
			scanf("%d",&x);
			if (x<0)rt=i;
			else e[x].push_back(i);
		}
		dfs(rt,0,0);
		for(int i=1;i<=n;i++)f[i]=i,d[i]=0;
	}
}T1,T2;
bool cmp(int x,int y){
	return T2.dfn[x]<T2.dfn[y];
}
int main(){
	scanf("%d%d%*d%d",&n,&m,&q);
	T1.read(),T2.read();
	for(int i=1;i<=n;i++)v[T1.dfn[i]]=i;
	sort(v+1,v+m+1,cmp);
	for(int i=1;i<=m;i++)printf("%d ",v[i]);
	puts(""),fflush(stdout);
	for(int i=1;i<m;i++)printf("? %d %d\n",v[i],v[i+1]);
	puts("!"),fflush(stdout);
	for(int i=1;i<m;i++){
		scanf("%d%d",&x,&y);
		z=T1.lca(v[i],v[i+1]);
		T1.merge(z,v[i],x),T1.merge(z,v[i+1],y);
		scanf("%d%d",&x,&y);
		z=T2.lca(v[i],v[i+1]);
		T2.merge(z,v[i],x),T2.merge(z,v[i+1],y);
	}
	for(int i=1;i<=n;i++)T1.find(i),T2.find(i);
	for(int i=1;i<=q;i++){
		scanf("%d%d",&x,&y);
		z=T1.lca(x,y);
		printf("%lld ",T1.d[x]+T1.d[y]-(T1.d[z]<<1));
		z=T2.lca(x,y);
		printf("%lld\n",T2.d[x]+T2.d[y]-(T2.d[z]<<1));
	}
	fflush(stdout);
	return 0;
}