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 = 0x3f3f3f3f;
const double eps = 1e-3;
const int MAXN = 1e5 + 10;
const int MAXM = 2e6 + 10;
const long long mod = 1e9;
int a[MAXN], b[MAXN];
int main() {
  int n, m, cl, ce, v;
  scanf("%d%d%d%d%d", &n, &m, &cl, &ce, &v);
  for (int i = 0; i < cl; i++) scanf("%d", &a[i]);
  for (int i = 0; i < ce; i++) scanf("%d", &b[i]);
  int q;
  scanf("%d", &q);
  while (q--) {
    int x1, y1, x2, y2;
    scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
    int ans = 1e9;
    if (cl) {
      int pos = lower_bound(a, a + cl, y1) - a;
      if (pos >= 0 && pos < cl)
        ans = min(ans, a[pos] - y1 + abs(x1 - x2) + abs(a[pos] - y2));
      pos--;
      if (pos >= 0 && pos < cl)
        ans = min(ans, abs(a[pos] - y1) + abs(x1 - x2) + abs(a[pos] - y2));
    }
    if (ce) {
      int pos = lower_bound(b, b + ce, y1) - b;
      if (pos >= 0 && pos < ce)
        ans = min(ans, b[pos] - y1 + (int)ceil((double)(abs(x1 - x2)) / v) +
                           abs(b[pos] - y2));
      pos--;
      if (pos >= 0 && pos < ce)
        ans = min(ans, b[pos] - y1 + (int)ceil((double)(abs(x1 - x2)) / v) +
                           abs(b[pos] - y2));
    }
    printf("%d\n", ans);
  }
  return 0;
}
