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;
const int INF = 1 << 30;
int s[111111], e[111111];
int main() {
  int n, m, cl, ce, v, x1, x2, y1, y2, q, ans, p;
  scanf("%d %d %d %d %d", &n, &m, &cl, &ce, &v);
  for (int i = 0; i < cl; i++) scanf("%d", &s[i]);
  for (int i = 0; i < ce; i++) scanf("%d", &e[i]);
  scanf("%d", &q);
  while (q--) {
    ans = INF;
    scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
    if (x1 == x2)
      ans = abs(y1 - y2);
    else {
      if (cl) {
        p = lower_bound(s, s + cl, y1) - s;
        if (p == cl)
          p = s[p - 1];
        else if (p) {
          if (abs(y1 - s[p]) > abs(y1 - s[p - 1]))
            p = s[p - 1];
          else
            p = s[p];
        } else
          p = s[p];
        ans = min(ans, abs(y1 - p) + abs(y2 - p) + abs(x1 - x2));
      }
      if (ce) {
        p = lower_bound(e, e + ce, y1) - e;
        if (p == ce)
          p = e[p - 1];
        else if (p) {
          if (abs(y1 - e[p]) > abs(y1 - e[p - 1]))
            p = e[p - 1];
          else
            p = e[p];
        } else
          p = e[p];
        ans = min(
            ans, abs(y1 - p) + abs(y2 - p) + (int)ceil(abs(x1 - x2) * 1.0 / v));
      }
    }
    printf("%d\n", ans);
  }
  return 0;
}
