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 N = 1e5 + 10;
int l[N], e[N];
int main() {
  int n, m, cl, ce, v;
  cin >> n >> m >> cl >> ce >> v;
  for (int i = 0; i < cl; i++) scanf("%d", &l[i]);
  l[cl] = m + 1;
  cl += 1;
  for (int i = 0; i < ce; i++) scanf("%d", &e[i]);
  e[ce] = m + 1;
  ce += 1;
  int q;
  int x1, x2, y1, y2;
  cin >> q;
  while (q--) {
    scanf("%d%d%d%d", &y1, &x1, &y2, &x2);
    int ans = 1e9 + 7;
    int p = lower_bound(l, l + cl, x1) - l;
    int temp;
    if (p != cl - 1) {
      temp = abs(x1 - l[p]) + abs(x2 - l[p]) + abs(y1 - y2);
      ans = min(ans, temp);
    }
    p -= 1;
    if (p >= 0) {
      temp = abs(x1 - l[p]) + abs(x2 - l[p]) + abs(y1 - y2);
      ans = min(ans, temp);
    }
    p = lower_bound(e, e + ce, x1) - e;
    if (p != ce - 1) {
      temp = abs(x1 - e[p]) + abs(x2 - e[p]);
      temp += abs(y1 - y2) / v;
      if (abs(y1 - y2) % v) temp += 1;
      ans = min(ans, temp);
    }
    p -= 1;
    if (p >= 0) {
      temp = abs(x1 - e[p]) + abs(x2 - e[p]);
      temp += abs(y1 - y2) / v;
      if (abs(y1 - y2) % v) temp += 1;
      ans = min(ans, temp);
    }
    if (y1 == y2) ans = abs(x1 - x2);
    printf("%d\n", ans);
  }
  return 0;
}
