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>
int cl, ce;
int l[100005], e[100005];
int64_t n, m, v;
int64_t ceil_div(int64_t a, int64_t b) {
  int64_t ans = a / b;
  if (a % b) ++ans;
  return ans;
}
int main(int argc, char* argv[]) {
  scanf("%lld%lld", &n, &m);
  scanf("%d%d", &cl, &ce);
  scanf("%lld", &v);
  for (int i = 0; i < cl; ++i) scanf("%d", &l[i]);
  for (int i = 0; i < ce; ++i) scanf("%d", &e[i]);
  int q;
  scanf("%d", &q);
  while (q--) {
    int64_t x1, y1, x2, y2;
    scanf("%lld%lld%lld%lld", &x1, &y1, &x2, &y2);
    if (x1 > x2) std::swap(x1, x2);
    if (y1 > y2) std::swap(y1, y2);
    if (x1 == x2) {
      printf("%lld\n", y2 - y1);
      continue;
    }
    int64_t ans = std::numeric_limits<int64_t>::max();
    int p = std::lower_bound(l, l + cl, y1) - l;
    if (p > 0) {
      int y = l[p - 1];
      ans = std::min(ans, (y1 - y) + (x2 - x1) + (y2 - y));
    }
    p = std::lower_bound(e, e + ce, y1) - e;
    if (p > 0) {
      int y = e[p - 1];
      ans = std::min(ans, (y1 - y) + ceil_div(x2 - x1, v) + (y2 - y));
    }
    p = std::lower_bound(l, l + cl, y1) - l;
    if (p < cl && l[p] <= y2) ans = std::min(ans, (y2 - y1) + (x2 - x1));
    p = std::lower_bound(e, e + ce, y1) - e;
    if (p < ce && e[p] <= y2)
      ans = std::min(ans, (y2 - y1) + ceil_div(x2 - x1, v));
    p = std::upper_bound(l, l + cl, y2) - l;
    if (p < cl) {
      int y = l[p];
      ans = std::min(ans, (y - y1) + (x2 - x1) + (y - y2));
    }
    p = std::upper_bound(e, e + ce, y2) - e;
    if (p < ce) {
      int y = e[p];
      ans = std::min(ans, (y - y1) + ceil_div(x2 - x1, v) + (y - y2));
    }
    printf("%lld\n", ans);
  }
  return 0;
}
