2 10 1 1 1
1
10
1
1 5 1 8
 4 4 1 0 1
1

1
1 2 1 4
 2 5 1 0 1
2

1
1 4 1 5
 10 10 1 8 4
10
2 3 4 5 6 7 8 9
10
1 1 3 1
2 1 7 1
1 1 9 1
7 1 4 1
10 1 7 1
2 1 7 1
3 1 2 1
5 1 2 1
10 1 5 1
6 1 9 1
 2 4 1 1 1
1
4
1
1 2 1 3
 2 2 0 1 1

1
1
1 2 2 2
 1000 1000 1 1 10
1
2
1
1 900 1 1000
 5 5 1 1 1
3
2
1
1 5 1 1
 2 4 1 1 1
1
2
1
2 3 2 4
 4 4 1 0 1
4

5
1 1 2 2
1 3 2 2
3 3 4 3
3 2 2 2
1 2 2 3

3
 2
 1
 3
4
4
3
3
4
3
3
4
3
 1
 3
 100
 4
 1
 6
4
3
5
4

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
const int MAXN = (int)2e5 + 500;
int n, m, S, L, v;
int st[MAXN], lf[MAXN];
int Q;
pair<pii, pii> qs[MAXN];
void read(pii &p) {
  cin >> p.first >> p.second;
  p.first--, p.second--;
}
bool read() {
  if (!(cin >> n >> m >> S >> L >> v)) {
    return 0;
  }
  for (int i = 0; i < int(S); ++i) {
    cin >> st[i];
    st[i]--;
  }
  for (int i = 0; i < int(L); ++i) {
    cin >> lf[i];
    lf[i]--;
  }
  cin >> Q;
  for (int i = 0; i < int(Q); ++i) {
    read(qs[i].first);
    read(qs[i].second);
  }
  return 1;
}
const int INF = (int)1e9;
set<int> sts, lfs;
void solve() {
  sts.clear();
  sts.insert(-INF);
  sts.insert(+INF);
  for (int i = 0; i < int(S); ++i) {
    sts.insert(st[i]);
  }
  lfs.clear();
  lfs.insert(-INF);
  lfs.insert(+INF);
  for (int i = 0; i < int(L); ++i) {
    lfs.insert(lf[i]);
  }
  for (int i = 0; i < int(Q); ++i) {
    int dh = abs(qs[i].first.first - qs[i].second.first);
    int xa = qs[i].first.second, xb = qs[i].second.second;
    if (xa > xb) {
      swap(xa, xb);
    }
    int ans = INF;
    auto ptr = sts.lower_bound(xa);
    for (int it = 0; it < int(2); ++it) {
      int x = *ptr;
      if (x == -INF) {
        break;
      }
      if (x < +INF) {
        ans = min(ans, abs(x - xa) + dh + abs(x - xb));
      }
      ptr--;
    }
    ptr = lfs.lower_bound(xa);
    for (int it = 0; it < int(2); ++it) {
      int x = *ptr;
      if (x == -INF) {
        break;
      }
      if (x < +INF) {
        ans = min(ans, abs(x - xa) + (dh + v - 1) / v + abs(x - xb));
      }
      ptr--;
    }
    assert(ans < INF);
    cout << ans << '\n';
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  while (read()) {
    solve();
  }
}
