1 1 2 2
1000000000 1000000000
1
 1 1 1000000000 1000000000
100 1000000000
1
 1 1 10 18
5 6
5
 2 1 1000000000 2000000000
111 999999999
101 999999998
1
 4 13 400 600
13 30
1 19
1 160
1 113
58 73 15 319 194 362 128 157 336 162 77 90 96
 1 15 100 200
283 8
30 58 16 45 80 82 55 95 24 23 86 28 51 47 20
 3 2 300 400
24 68
13 65
15 113
127 177
 1 1 2 1
1 10
1
 4 2 7 15
10 9
4 4
9 3
4 10
1 6
 2 1 1000000000 2000000000
111 1000000000
101 1000000000
5
 2 1 1000000000 2000000000
111 999999998
101 999999998
1
 1 1 1000000000 1000000000
1 1000000000
1

1000000000
 -1
 5
 111
 1
 -1
 -1
 -1
 4
 101
 -1
 -1

#include <bits/stdc++.h>
int cmp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int n, m, cl, ce, v, q;
int l[100005], e[100005];
int a1, b1, a2, b2;
int stairfind(int x) {
  int left = 0, right = cl;
  int mid = (left + right) / 2;
  while (left <= right) {
    if (l[mid] > x)
      right = mid - 1;
    else if (l[mid] < x)
      left = mid + 1;
    else
      return l[mid];
    mid = (left + right) / 2;
  }
  return l[mid];
}
int liftfind(int x) {
  int left = 0, right = cl;
  int mid = (left + right) / 2;
  while (left <= right) {
    if (e[mid] > x)
      right = mid - 1;
    else if (e[mid] < x)
      left = mid + 1;
    else
      return e[mid];
    mid = (left + right) / 2;
  }
  return e[mid];
}
int main() {
  scanf("%d %d %d %d %d", &n, &m, &cl, &ce, &v);
  int i;
  for (i = 0; i < cl; i++) scanf("%d", &l[i]);
  for (i = 0; i < ce; i++) scanf("%d", &e[i]);
  qsort(l, cl, sizeof(int), cmp);
  qsort(e, ce, sizeof(int), cmp);
  scanf("%d", &q);
  while (q--) {
    scanf("%d %d %d %d", &a1, &b1, &a2, &b2);
    int flagl = stairfind(a1);
    int flage = liftfind(a1);
    int xl = abs(a1 - flagl) + abs(a2 - flagl) + abs(b1 - b2);
    int xe = abs(a1 - flage) + abs(a2 - flage) + abs(b1 - b2) / v;
    printf("%d\n", xl < xe ? xl : xe);
  }
}
