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 long long N = 1e5 + 10, M = 1e9, eps = 1e-7, MOD = 1e9 + 7;
long long l[N];
long long e[N];
int main() {
  long long n, m, cl, ce, v;
  cin >> n >> m >> cl >> ce >> v;
  for (long long i = 0; i < cl; i++) cin >> l[i];
  for (long long i = 0; i < ce; i++) cin >> e[i];
  long long q;
  cin >> q;
  while (q--) {
    long long x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    if (x2 < x1) swap(x1, x2);
    if (y2 < y1) swap(y1, y2);
    if (x1 == x2) {
      cout << y2 - y1 << "\n";
      continue;
    }
    long long res = LLONG_MAX;
    long long ind = upper_bound(l, l + cl, y1) - l;
    if (l[ind] > y1 && l[ind] < y2)
      res = y2 - y1 + x2 - x1;
    else {
      if (ind != 0) res = min(res, y2 - y1 + x2 - x1 + 2 * (y1 - l[ind - 1]));
      if (ind != cl) res = min(res, y2 - y1 + x2 - x1 + 2 * (l[ind] - y2));
    }
    ind = upper_bound(e, e + ce, y1) - e;
    if (e[ind] > y1 && e[ind] < y2)
      res = min(res, y2 - y1 + ((x2 - x1) + v - 1) / v);
    else {
      if (ind != 0)
        res =
            min(res, y2 - y1 + ((x2 - x1) + v - 1) / v + 2 * (y1 - e[ind - 1]));
      if (ind != ce)
        res = min(res, y2 - y1 + ((x2 - x1) + v - 1) / v + 2 * (e[ind] - y2));
    }
    cout << res << "\n";
  }
}
