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[100005], e[100005];
int x, y, x2, y2;
int FindMin() {
  int idx = lower_bound(l, l + cl, y) - l;
  int idx2 = lower_bound(e, e + ce, y) - e;
  int ans = 0x3f3f3f3f;
  if (cl == 0)
    ;
  else if (idx == 0) {
    ans = min(ans, abs(y - l[idx]) + abs(y2 - l[idx]) + abs(x - x2));
  } else if (idx == cl) {
    idx--;
    ans = min(ans, abs(y - l[idx]) + abs(y2 - l[idx]) + abs(x - x2));
  } else {
    ans = min(ans, abs(y - l[idx]) + abs(y2 - l[idx]) + abs(x - x2));
    idx--;
    ans = min(ans, abs(y - l[idx]) + abs(y2 - l[idx]) + abs(x - x2));
  }
  if (ce == 0)
    ;
  else if (idx2 == 0) {
    ans = min(ans, abs(y - e[idx2]) + abs(y2 - e[idx2]) + abs(x - x2) / v +
                       (abs(x - x2) % v != 0));
  } else if (idx2 == ce) {
    idx2--;
    ans = min(ans, abs(y - e[idx2]) + abs(y2 - e[idx2]) + abs(x - x2) / v +
                       (abs(x - x2) % v != 0));
  } else {
    ans = min(ans, abs(y - e[idx2]) + abs(y2 - e[idx2]) + abs(x - x2) / v +
                       (abs(x - x2) % v != 0));
    idx2--;
    ans = min(ans, abs(y - e[idx2]) + abs(y2 - e[idx2]) + abs(x - x2) / v +
                       (abs(x - x2) % v != 0));
  }
  return ans;
}
int main() {
  scanf("%d%d%d%d%d", &n, &m, &cl, &ce, &v);
  for (int i = 0; i < cl; i++) {
    scanf("%d", &l[i]);
  }
  for (int i = 0; i < ce; i++) {
    scanf("%d", &e[i]);
  }
  int q;
  scanf("%d", &q);
  while (q--) {
    scanf("%d%d%d%d", &x, &y, &x2, &y2);
    if (x == x2) {
      printf("%d\n", abs(y - y2));
      continue;
    }
    printf("%d\n", FindMin());
  }
  return 0;
}
