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;
int n, m, cl, ce, v;
int L[101010], e[101010];
int xabs(int x) { return x > 0 ? x : -x; }
int solve(int x, int y, int xx, int yy) {
  int ans = 2000000001;
  int l = 1, r = ce;
  while (l < r) {
    int mid = (l + r) >> 1;
    if (e[mid] > x)
      r = mid;
    else
      l = mid + 1;
  }
  for (int i = max(1, l - 2); i <= min(ce, l + 2); i++) {
    int a = xabs(e[i] - x) + xabs(e[i] - xx);
    int b = (xabs(yy - y)) / v;
    if (xabs(yy - y) % v) b++;
    ans = min(ans, a + b);
  }
  l = 1;
  r = cl;
  while (l < r) {
    int mid = (l + r) >> 1;
    if (L[mid] > x)
      r = mid;
    else
      l = mid + 1;
  }
  for (int i = max(1, l - 2); i <= min(cl, l + 2); i++) {
    int a = xabs(L[i] - x) + xabs(L[i] - xx);
    int b = xabs(yy - y);
    ans = min(ans, a + b);
  }
  if (yy == y) ans = min(ans, xabs(xx - x));
  return ans;
}
int main() {
  cin >> n >> m >> cl >> ce >> v;
  for (int i = 1; i <= cl; i++) scanf("%d", &L[i]);
  for (int i = 1; i <= ce; i++) scanf("%d", &e[i]);
  int q;
  scanf("%d", &q);
  while (q--) {
    int x, y, xx, yy;
    scanf("%d%d%d%d", &x, &y, &xx, &yy);
    swap(x, y);
    swap(xx, yy);
    int a = solve(x, y, xx, yy);
    int b = solve(xx, yy, x, y);
    printf("%d\n", min(a, b));
  }
  return 0;
}
