#include "bits/stdc++.h"
#pragma GCC optimize("Ofast")
using namespace std;
#ifdef LOCAL
#include "debug.cpp"
#else
#define debug(...)
#endif
int n,k;
vector<pair<int,int>> queries;
vector<int> v1,st1,v2,st2;set<int> loli,loli2;
int in[1000001][2],outt[1000001][2],timer = 0;
int P[1000001][2][20];
int cost[1300001][2][20];
int dep[1000001][2];
int root[1000001][2];
bool vis[1000001][2];
vector<int> adj[2][1000001],vert[1000001][2];
vector<pair<int,int>> lens[1000001][2];
void dfs(int i,int pr,int ty){
if(ty){
if(v1.size()<k)v1.push_back(i);
if(v2.size()<k)v2.push_back(i);
}
in[i][ty] = ++timer;
P[i][ty][0] = pr;
dep[i][ty] = dep[pr][ty]+1;
for(int j = 1;j<20;j++){
P[i][ty][j] = P[P[i][ty][j-1]][ty][j-1];
}
for(auto j:adj[ty][i]){
if(j==pr)continue;
dfs(j,i,ty);
}
outt[i][ty] = timer;
}
bool comp1(int a,int b){
return in[a][0]<in[b][0];
}
bool comp2(int a,int b){
return in[a][1]<in[b][1];
}
int lca(int a,int b,int ty){
if(dep[a][ty]<dep[b][ty])swap(a,b);
for(int i = 19;i>=0;i--){
if(dep[a][ty]-(1<<i)>=dep[b][ty]){
a = P[a][ty][i];
}
}
if(a==b)return a;
for(int i = 19;i>=0;i--){
if(P[a][ty][i]!=P[b][ty][i]){
a = P[a][ty][i];
b = P[b][ty][i];
}
}
return P[a][ty][0];
}
bool upper(int a,int b,int ty){
return in[a][ty]<=in[b][ty]&&outt[a][ty]>=outt[b][ty];
}
void dfs3(int i,int pr,int cost,int ty){
root[i][ty] = cost;
vis[i][ty] = 1;
for(auto j:lens[i][ty]){
if(!vis[j.first][ty]){
dfs3(j.first,i,cost+j.second,ty);
}
}
}
void dfs2(int i,int pr,int ty){
P[i][ty][0] = pr;
cost[i][ty][0] = root[i][ty]-root[pr][ty];
dep[i][ty] = dep[pr][ty]+1;
for(int j = 1;j<20;j++){
P[i][ty][j] = P[P[i][ty][j-1]][ty][j-1];
cost[i][ty][j] = cost[i][ty][j-1]+cost[P[i][ty][j-1]][ty][j-1];
}
for(auto j:vert[i][ty]){
if(j==pr)continue;
dfs2(j,i,ty);
}
}
long long lca2(int a,int b,int ty){
if(dep[a][ty]<dep[b][ty])swap(a,b);
long long summ = 0;
for(int i = 19;i>=0;i--){
if(dep[a][ty]-(1<<i)>=dep[b][ty]){
summ+=cost[a][ty][i];
a = P[a][ty][i];
}
}
if(a==b)return summ;
for(int i = 19;i>=0;i--){
if(P[a][ty][i]!=P[b][ty][i]){
summ+=cost[a][ty][i];
summ+=cost[b][ty][i];
a = P[a][ty][i];
b = P[b][ty][i];
}
}
return summ+cost[a][ty][0]+cost[b][ty][0];
}
void query(int a,int b){
cout<<"? "<<a<<" "<<b<<"\n";
//int x,y,z,e;
//cin>>x>>y>>z>>e;
//return {x,y,z,e};
}
signed main() {
ios_base::sync_with_stdio(false);cin.tie(0);
//freopen("prize.in.1c","r",stdin);
int g,t;
cin>>n>>k>>g>>t;
int root1 , root2;
for(int i = 1;i<=n;i++){
int x;cin>>x;
if(x==-1){
root1 = i;
}else{
adj[0][x].push_back(i);
adj[0][i].push_back(x);
}
}
for(int i = 1;i<=n;i++){
int x;cin>>x;
if(x==-1){
root2 = i;
}else{
adj[1][x].push_back(i);
adj[1][i].push_back(x);
}
}
dfs(root1,0,0);
timer = 0;
dfs(root2,0,1);
for(auto i:v1){
cout<<i<<" ";
}
cout<<endl;
sort(v1.begin(),v1.end(),comp1);
sort(v2.begin(),v2.end(),comp1);
for(int i = 1;i<k;i++){
query(v1[i-1],v1[i]);
//lens[lca(v[i],v[i-1],0)].push_back({v[i-1],lol[0]});
//lens[lca(v[i],v[i-1],0)].push_back({v[i],lol[1]});
v1.push_back(lca(v1[i],v1[i-1],0));
}
for(int i = 1;i<k;i++){
//query(v2[i-1],v2[i]);
//lens[lca(v[i],v[i-1],0)].push_back({v[i-1],lol[0]});
//lens[lca(v[i],v[i-1],0)].push_back({v[i],lol[1]});
v2.push_back(lca(v2[i],v2[i-1],1));
}
cout.flush();
cout<<"!"<<endl;
for(int i = 1;i<k;i++){
int x,y,z,e;cin>>x>>y>>z>>e;
lens[lca(v1[i],v1[i-1],0)][0].push_back({v1[i-1],x});
lens[lca(v1[i],v1[i-1],0)][0].push_back({v1[i],y});
lens[v1[i-1]][0].push_back({lca(v1[i],v1[i-1],0),-x});
lens[v1[i]][0].push_back({lca(v1[i],v1[i-1],0),-y});
lens[lca(v2[i],v2[i-1],1)][1].push_back({v2[i-1],z});
lens[lca(v2[i],v2[i-1],1)][1].push_back({v2[i],e});
lens[v2[i-1]][1].push_back({lca(v2[i],v2[i-1],1),-z});
lens[v2[i]][1].push_back({lca(v2[i],v2[i-1],1),-e});
}
sort(v1.begin(),v1.end(),comp1);
for(auto i:v1)loli.insert(i);
v1.clear();
for(auto i:loli)v1.push_back(i);
sort(v1.begin(),v1.end(),comp1);
st1.push_back(v1[0]);
for(int i = 1;i<v1.size();i++){
while(st1.size()>1&&!upper(st1.back(),v1[i],0)){
vert[st1[st1.size()-2]][0].push_back(st1.back());
st1.pop_back();
}
st1.push_back(v1[i]);
}
while(st1.size()>1){
vert[st1[st1.size()-2]][0].push_back(st1.back());
st1.pop_back();
}
sort(v2.begin(),v2.end(),comp2);
for(auto i:v2)loli2.insert(i);
v2.clear();
for(auto i:loli2)v2.push_back(i);
sort(v2.begin(),v2.end(),comp2);
st2.push_back(v2[0]);
for(int i = 1;i<v2.size();i++){
while(st2.size()>1&&!upper(st2.back(),v2[i],1)){
vert[st2[st2.size()-2]][1].push_back(st2.back());
st2.pop_back();
}
st2.push_back(v2[i]);
}
while(st2.size()>1){
vert[st2[st2.size()-2]][1].push_back(st2.back());
st2.pop_back();
}
timer = 0;
dfs3(st1[0],0,0,0);
dfs3(st2[0],0,0,1);
dfs2(st1[0],0,0);
dfs2(st2[0],0,1);
while(t--){
int a,b;cin>>a>>b;
queries.push_back({a,b});
}
for(auto i:queries){
cout<<lca2(i.first,i.second,0)<<" "<<lca2(i.first,i.second,1)<<"\n";
}
cout<<endl;
}
