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() {
  int n, m, cl, ce, v;
  cin >> n >> m >> cl >> ce >> v;
  vector<int> ls, es;
  for (int i = 0; i < cl; i++) {
    int l;
    cin >> l;
    ls.push_back(l);
  }
  for (int i = 0; i < ce; i++) {
    int e;
    cin >> e;
    es.push_back(e);
  }
  int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    int x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    if (x1 == x2) {
      cout << abs(y2 - y1) << endl;
      continue;
    }
    if (y1 > y2) swap(y1, y2);
    int ans = 1e9 + 7;
    int pl = upper_bound(ls.begin(), ls.end(), y1) - ls.begin();
    if (pl < cl)
      ans = min(ans, abs(y2 - ls[pl]) + abs(ls[pl] - y1) + abs(x2 - x1));
    if (pl > 0)
      ans =
          min(ans, abs(y2 - ls[pl - 1]) + abs(ls[pl - 1] - y1) + abs(x2 - x1));
    int pe = upper_bound(es.begin(), es.end(), y1) - es.begin();
    if (pe < ce)
      ans = min(ans, abs(y2 - es[pe]) + abs(es[pe] - y1) +
                         (abs(x2 - x1) + v - 1) / v);
    if (pe > 0)
      ans = min(ans, abs(y2 - es[pe - 1]) + abs(es[pe - 1] - y1) +
                         (abs(x2 - x1) + v - 1) / v);
    cout << ans << endl;
  }
  return 0;
}
