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 mod = 1000000000 + 9;
const int N = 200050;
int main() {
  int n, m, cl, ce, v;
  cin >> n >> m >> cl >> ce >> v;
  vector<int> l(cl);
  vector<int> e(ce);
  for (int i = 0; i < cl; i++) cin >> l[i];
  for (int i = 0; i < ce; i++) cin >> e[i];
  sort(l.begin(), l.end());
  sort(e.begin(), e.end());
  int q;
  cin >> q;
  while (q--) {
    long long x1, y1;
    cin >> y1 >> x1;
    long long x2, y2;
    cin >> y2 >> x2;
    long long h = abs(y1 - y2);
    long long tl = h;
    long long te = ((h + v - 1) / v);
    int ldi = upper_bound(l.begin(), l.end(), x1) - l.begin();
    int edi = upper_bound(e.begin(), e.end(), x1) - e.begin();
    long long ans = 1LL << 50;
    if (h == 0) {
      cout << abs(x1 - x2) << endl;
      continue;
    }
    if (cl) {
      ldi = min(ldi, cl - 1);
      long long ld = l[ldi];
      ans = min(ans, tl + abs(x1 - ld) + abs(ld - x2));
      ldi = max(ldi - 1, 0);
      ld = l[ldi];
      ans = min(ans, tl + abs(x2 - ld) + abs(ld - x1));
    }
    if (ce) {
      edi = min(edi, ce - 1);
      long long ed = e[edi];
      ans = min(ans, te + abs(x2 - ed) + abs(ed - x1));
      edi = max(edi - 1, 0);
      ed = e[edi];
      ans = min(ans, te + abs(x2 - ed) + abs(ed - x1));
    }
    cout << ans << '\n';
  }
  return 0;
}
