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 f(int a, int b) { return abs(a - b); }
int main() {
  std::ios_base::sync_with_stdio(false);
  ;
  int n, m, cl, ce, v;
  cin >> n >> m >> cl >> ce >> v;
  int L[cl + 1], E[ce + 1];
  for (int i = 0; i < cl; i++) cin >> L[i];
  for (int i = 0; i < ce; i++) cin >> E[i];
  sort(L, L + cl);
  sort(E, E + ce);
  int q;
  cin >> q;
  int x1, x2, y1, y2;
  while (q--) {
    cin >> x1 >> y1 >> x2 >> y2;
    if (x1 == x2) {
      cout << abs(y1 - y2) << "\n";
      continue;
    }
    int X1 = INT_MAX, X2 = INT_MAX, X3 = INT_MAX, X4 = INT_MAX;
    if (cl != 0) {
      int k = upper_bound(L, L + cl, y1) - L;
      int kk = k - 1;
      if (k < cl) X1 = f(x1, x2) + f(y1, L[k]) + f(y2, L[k]);
      if (kk >= 0) X2 = f(x1, x2) + f(y1, L[kk]) + f(y2, L[kk]);
    }
    if (ce != 0) {
      int k = upper_bound(E, E + ce, y1) - E;
      int kk = k - 1;
      if (k < cl) X3 = f(y1, E[k]) + f(y2, E[k]) + (f(x1, x2) + v - 1) / v;
      if (kk >= 0) X2 = f(y1, E[kk]) + f(y2, E[kk]) + (f(x1, x2) + v - 1) / v;
    }
    cout << min(min(X1, X2), min(X3, X4)) << "\n";
  }
  return 0;
}
