#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
const int INF = 1 << 30;
int st[maxn], el[maxn];
int n, m, stnum, elnum, v;
bool check1(int x) { return x >= 1 && x <= stnum; }
bool check2(int x) { return x >= 1 && x <= elnum; }
int main() {
  scanf("%d%d%d%d%d", &n, &m, &stnum, &elnum, &v);
  for (int i = 1; i <= stnum; i++) scanf("%d", &st[i]);
  for (int i = 1; i <= elnum; i++) scanf("%d", &el[i]);
  int q;
  scanf("%d", &q);
  while (q--) {
    int x1, y1, x2, y2;
    scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
    if (x1 > x2) {
      swap(x1, x2);
      swap(y1, y2);
    }
    int ans = INF;
    if (x1 == x2)
      ans = abs(y1 - y2);
    else {
      int ans1, ans2;
      int tmp = lower_bound(st + 1, st + stnum + 1, y1) - st;
      ans1 =
          min(check1(tmp) ? (abs(y1 - st[tmp]) + abs(y2 - st[tmp])) : INF,
              (check1(tmp - 1) ? abs(y1 - st[tmp - 1]) + abs(y2 - st[tmp - 1])
                               : INF)) +
          (x2 - x1);
      tmp = lower_bound(el + 1, el + elnum + 1, y1) - el;
      if (tmp == 0)
        ans2 = INF;
      else
        ans2 =
            min(check2(tmp) ? abs(y1 - el[tmp]) + abs(y2 - el[tmp]) : INF,
                (check2(tmp - 1) ? abs(y1 - el[tmp - 1]) + abs(y2 - el[tmp - 1])
                                 : INF)) +
            (x2 - x1) / v + ((x2 - x1) % v != 0);
      ans = min(ans1, ans2);
    }
    printf("%d\n", ans);
  }
  return 0;
}
