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, ce, cl, v;
int posl[1000010], posr[1000010];
int main() {
  scanf("%d%d%d%d%d", &n, &m, &cl, &ce, &v);
  for (int i = 1; i <= cl; i++) {
    scanf("%d", &posl[i]);
  }
  for (int i = 1; i <= ce; i++) scanf("%d", &posr[i]);
  sort(posl + 1, posl + cl + 1);
  sort(posr + 1, posr + ce + 1);
  int t;
  cin >> t;
  while (t--) {
    int x, y, xx, yy;
    int anss = 2e9;
    scanf("%d%d%d%d", &x, &y, &xx, &yy);
    if (x == xx) {
      printf("%d\n", abs(yy - y));
      continue;
    }
    int l = 1, r = cl, ans = 0;
    while (l <= r) {
      int mid = (l + r) >> 1;
      if (posl[mid] >= y)
        r = mid - 1, ans = mid;
      else
        l = mid + 1;
    }
    if (ans)
      anss = min(anss, abs(xx - x) + abs(posl[ans] - y) + abs(posl[ans] - yy));
    l = 1, r = cl, ans = 0;
    while (l <= r) {
      int mid = (l + r) >> 1;
      if (posl[mid] <= y)
        l = mid + 1, ans = mid;
      else
        r = mid - 1;
    }
    if (ans)
      anss = min(anss, abs(xx - x) + abs(posl[ans] - y) + abs(posl[ans] - yy));
    l = 1, r = ce, ans = 0;
    while (l <= r) {
      int mid = (l + r) >> 1;
      if (posr[mid] >= y)
        r = mid - 1, ans = mid;
      else
        l = mid + 1;
    }
    if (ans) {
      anss = min(anss, abs(posr[ans] - y) + abs(posr[ans] - yy) +
                           (int)ceil((double)abs(xx * 1.0 - x * 1.0) /
                                     (double)v * 1.0));
    }
    l = 1, r = ce, ans = 0;
    while (l <= r) {
      int mid = (l + r) >> 1;
      if (posr[mid] <= y)
        l = mid + 1, ans = mid;
      else
        r = mid - 1;
    }
    if (ans) {
      anss = min(anss, abs(posr[ans] - y) + abs(posr[ans] - yy) +
                           (int)ceil((double)abs(xx * 1.0 - x * 1.0) /
                                     (double)v * 1.0));
    }
    printf("%d\n", anss);
  }
  return 0;
}
