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 main() {
  set<int> A, B;
  int n, m, a, b, v;
  cin >> n >> m >> a >> b >> v;
  for (int i = 0; i < a; i++) {
    int x;
    cin >> x;
    A.insert(x);
  }
  for (int i = 0; i < b; i++) {
    int x;
    cin >> x;
    B.insert(x);
  }
  int q;
  cin >> q;
  while (q--) {
    int ans = 1e9;
    int x1, y1, x2, y2;
    scanf("%d%d%d%d", &y1, &x1, &y2, &x2);
    if (y1 == y2) {
      cout << abs(x2 - x1) << endl;
      continue;
    }
    int S = (abs(y2 - y1));
    int E = (S + v - 1) / v;
    auto it = B.lower_bound(x1);
    if (it != B.end()) {
      int X = (*it);
      ans = abs(X - x1) + abs(X - x2) + E;
    }
    if (it != B.begin()) {
      it--;
      int X = (*it);
      ans = min(ans, abs(X - x1) + abs(X - x2) + E);
    }
    it = A.lower_bound(x1);
    if (it != A.end()) {
      int X = (*it);
      ans = min(ans, abs(X - x1) + abs(X - x2) + S);
    }
    if (it != A.begin()) {
      it--;
      int X = (*it);
      ans = min(ans, abs(X - x1) + abs(X - x2) + S);
    }
    cout << ans << endl;
  }
}
