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() {
  ios::sync_with_stdio(false);
  cin.tie();
  long long n, m, c, l, v, q, x, y, z, x1, y1, x2, y2, ans, cost;
  vector<long long> s, e;
  cin >> n >> m >> c >> l >> v;
  for (int i = 0; i < c; i++) {
    cin >> x;
    s.push_back(x);
  }
  for (int i = 0; i < l; i++) {
    cin >> y;
    e.push_back(y);
  }
  sort(s.begin(), s.end());
  sort(e.begin(), e.end());
  cin >> q;
  while (q--) {
    cin >> x1 >> y1 >> x2 >> y2;
    ans = 1e18;
    if (s.size() > 0) {
      y = lower_bound(s.begin(), s.end(), y1) - s.begin();
      if (y > 0) y--;
      if (y != s.size() && s[y] < y1) {
        cost = y1 - s[y];
        cost += abs(x1 - x2);
        cost += abs(y2 - s[y]);
        ans = min(ans, cost);
      }
      y = upper_bound(s.begin(), s.end(), y1) - s.begin();
      if (y != s.size() && s[y] > y1) {
        cost = s[y] - y1;
        cost += abs(x1 - x2);
        cost += abs(y2 - s[y]);
        ans = min(ans, cost);
      }
    }
    if (e.size() > 0) {
      y = lower_bound(e.begin(), e.end(), y1) - e.begin();
      if (y > 0) y--;
      if (y != s.size() && e[y] < y1) {
        cost = y1 - e[y];
        cost += ceil(abs(x1 - x2) / (double)v);
        cost += abs(y2 - e[y]);
        ans = min(ans, cost);
      }
      y = upper_bound(e.begin(), e.end(), y1) - e.begin();
      if (y != s.size() && e[y] > y1) {
        cost = e[y] - y1;
        cost += ceil(abs(x1 - x2) / (double)v);
        cost += abs(y2 - e[y]);
        ans = min(ans, cost);
      }
    }
    cout << ans << endl;
  }
  return 0;
}
