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 inf = 0x3f3f3f3f;
int al[100010], ae[100010];
int main() {
  int n, m, cl, ce, v;
  scanf("%d%d%d%d%d", &n, &m, &cl, &ce, &v);
  for (int i = 0; i < cl; i++) {
    scanf("%d", &al[i]);
  }
  for (int i = 0; i < ce; i++) {
    scanf("%d", &ae[i]);
  }
  int q;
  int x1, y1, x2, y2;
  scanf("%d", &q);
  while (q--) {
    scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
    int ans = inf, k;
    k = lower_bound(ae, ae + ce, x1) - ae;
    if (k < ce) {
      ans = min(ans, abs(ae[k] - y1) + abs(ae[k] - y2));
    }
    if (k > 0) {
      ans = min(ans, abs(ae[k - 1] - y1) + abs(ae[k - 1] - y2));
    }
    ans += abs(x1 - x2) / v;
    if (abs(x1 - x2) % v) ans++;
    k = lower_bound(al, al + cl, x1) - al;
    if (k < cl) {
      ans = min(ans, abs(x1 - x2) + abs(al[k] - y1) + abs(al[k] - y2));
    }
    if (k > 0) {
      ans = min(ans, abs(x1 - x2) + abs(al[k - 1] - y1) + abs(al[k - 1] - y2));
    }
    cout << ans << endl;
  }
  return 0;
}
