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 n, m, cl, ce, v;
int l[100105], e[100105];
int q, xa, ya, xb, yb;
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n >> m >> cl >> ce >> v;
  for (int i = 0; i < cl; ++i) cin >> l[i];
  for (int i = 0; i < ce; ++i) cin >> e[i];
  cin >> q;
  while (q--) {
    cin >> ya >> xa >> yb >> xb;
    if (ya == yb) {
      cout << abs(xa - xb) << "\n";
      continue;
    }
    int ans = 2e9;
    int li = lower_bound(l, l + cl, xa) - l;
    if (li < cl)
      ans = min(ans, abs(xa - l[li]) + abs(ya - yb) + abs(l[li] - xb));
    if (li > 0)
      ans = min(ans, abs(xa - l[li - 1]) + abs(ya - yb) + abs(l[li - 1] - xb));
    int ei = lower_bound(e, e + ce, xa) - e;
    if (ei < ce)
      ans = min(ans,
                abs(xa - e[ei]) + (abs(ya - yb) + v - 1) / v + abs(e[ei] - xb));
    if (ei > 0)
      ans = min(ans, abs(xa - e[ei - 1]) + (abs(ya - yb) + v - 1) / v +
                         abs(e[ei - 1] - xb));
    cout << ans << "\n";
  }
}
