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 divmod(int a, int b) { return a / b + bool(a % b); }
int main() {
  int n, m, cl, ce, v;
  cin >> n >> m >> cl >> ce >> v;
  set<int> l, e;
  for (int i = 0; i < cl; ++i) {
    int tmp;
    cin >> tmp;
    l.insert(tmp);
  }
  for (int i = 0; i < ce; ++i) {
    int tmp;
    cin >> tmp;
    e.insert(tmp);
  }
  int q, x1, x2, y1, y2;
  const int INF = 1e9;
  cin >> q;
  for (int qi = 0; qi < q; ++qi) {
    if (qi) {
      cout << endl;
    }
    cin >> x1 >> y1 >> x2 >> y2;
    if (x1 == x2) {
      cout << abs(y1 - y2);
      continue;
    }
    int ans = INF;
    set<int>::iterator it = l.upper_bound(y1);
    if (it != l.end()) {
      ans = min(ans, abs(y1 - *it) + abs(x1 - x2) + abs(*it - y2));
    }
    if (it != l.begin()) {
      --it;
      ans = min(ans, abs(y1 - *it) + abs(x1 - x2) + abs(*it - y2));
    }
    it = e.upper_bound(y1);
    if (it != e.end()) {
      ans = min(ans, abs(y1 - *it) + divmod(abs(x1 - x2), v) + abs(*it - y2));
    }
    if (it != e.begin()) {
      --it;
      ans = min(ans, abs(y1 - *it) + divmod(abs(x1 - x2), v) + abs(*it - y2));
    }
    cout << ans;
  }
  return 0;
}
