#ifdef LOCAL
#include "stdafx.h"
#else
#include <bits/stdc++.h>
#define IL inline
#define LL long long
#define eb emplace_back
#define L(i, j, k) for (int i = (j); i <= (k); ++i)
#define R(i, j, k) for (int i = (j); i >= (k); --i)
#define FIO(FILE) freopen(FILE".in", "r", stdin), freopen(FILE".out", "w", stdout)
using namespace std;

using vi = vector<int>;
#endif

constexpr int N = 1e6 + 9;
int n, K, Q, T;
vi S;

struct tree {
  int rt, hd[N], tot;

  struct {
    int v, nx;
  } e[N];

  void add_edge (int u, int v) {
    e[++tot] = {v, hd[u]};
    hd[u] = tot;
  }

  int dfn[N], dfc, st[20][N];

  void dfs (int u, int f) {
    st[0][dfn[u] = ++dfc] = f;
    for (int i = hd[u], v; i; i = e[i].nx) {
      dfs(v = e[i].v, u);
    }
  }

  int C (int x, int y) {
    return dfn[x] < dfn[y] ? x : y;
  }

  void init () {
    L (i, 1, 19) {
      L (j, 1, n - (1 << i) + 1) {
        st[i][j] = C(st[i - 1][j], st[i - 1][j + (1 << (i - 1))]);
      }
    }
  }

  int lca (int x, int y) {
    if (x == y) {
      return x;
    }
    if ((x = dfn[x]) > (y = dfn[y])) {
      swap(x, y);
    }
    int i = __lg(y - x++);
    return C(st[i][x], st[i][y - (1 << i) + 1]);
  }

  void in () {
    L (x, 1, n) {
      int y;
      scanf("%d", &y);
      if (~y) {
        add_edge(y, x);
      } else {
        rt = x;
      }
    }
    dfs(rt, 0);
    init();
  }

  vector<pair<int, int>> g[N];
  int d[N];

  void add (int u, int v, int w) {
    g[u].eb(v, w);
    g[v].eb(u, -w);
  }

  void sol () {
    int R = S[0];
    L (i, 1, K - 1) {
      R = lca(R, S[i]);
    }
    memset(d, -1, (n + 1) << 2);
    queue<int> q;
    q.push(R);
    d[R] = 0;
    while (!q.empty()) {
      int u = q.front();
      q.pop();
      for (auto [v, w] : g[u]) {
        if (d[v] == -1) {
          d[v] = d[u] + w;
          assert(d[v] >= 0);
          q.push(v);
        }
      }
    }
  }

  int dis (int x, int y) {
    return d[x] + d[y] - 2 * d[lca(x, y)];
  }
} t[2];

int main () {
  scanf("%d%d%d%d", &n, &K, &Q, &T);
  L (i, 0, 1) {
    t[i].in();
  }
  S.reserve(K);
  L (i, 1, n) {
    if (t[0].dfn[i] <= K) {
      S.eb(i);
    }
  }
  L (i, 0, K - 1) {
    printf("%d ", S[i]);
  }
  printf("\n");
  fflush(stdout);
  sort(S.begin(), S.end(), [] (int x, int y) {
    return t[1].dfn[x] < t[1].dfn[y];
  });
  L (i, 1, K - 1) {
    printf("? %d %d\n", S[i - 1], S[i]);
  }
  printf("!\n");
  fflush(stdout);
  L (i, 1, K - 1) {
    // int l = t[0].lca(S[i - 1], S[i]);
    int d1, d2;
    scanf("%d%d", &d1, &d2);
    // t[0].add(l, S[i - 1], d1);
    // t[0].add(l, S[i], d2);
    // l = t[1].lca(S[i - 1], S[i]);
    scanf("%d%d", &d1, &d2);
    // t[1].add(l, S[i - 1], d1);
    // t[1].add(l, S[i], d2);
  }
  // t[0].sol();
  // t[1].sol();
  while (T--) {
    int x, y;
    scanf("%d%d", &x, &y);
    printf("%d %d\n", t[0].dis(x, y), t[1].dis(x, y));
  }
  fflush(stdout);
}
// I love WHQ!