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;
  cin >> n >> m;
  int c1, c2;
  long long v;
  cin >> c1 >> c2 >> v;
  vector<long long> l(c1), e(c2);
  for (auto &x : l) cin >> x;
  for (auto &x : e) cin >> x;
  int q;
  cin >> q;
  while (q--) {
    long long x1, x2, y1, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    if (x1 == x2) {
      cout << abs(y1 - y2) << "\n";
      continue;
    }
    long long ans = 100000000000000000;
    auto itl = lower_bound(l.begin(), l.end(), y1);
    auto ite = lower_bound(e.begin(), e.end(), y1);
    if (c1 != 0) {
      if (itl != l.end()) {
        ans = min(ans, abs(*itl - y1) + abs(*itl - y2) + abs(x1 - x2));
      }
      if (itl != l.begin()) {
        itl--;
        ans = min(ans, abs(*itl - y1) + abs(*itl - y2) + abs(x1 - x2));
      }
    }
    if (c2 != 0) {
      if (ite != e.end()) {
        ans = min(ans,
                  abs(*ite - y1) + abs(*ite - y2) + (abs(x1 - x2) + v - 1) / v);
      }
      if (ite != e.begin()) {
        ite--;
        ans = min(ans,
                  abs(*ite - y1) + abs(*ite - y2) + (abs(x1 - x2) + v - 1) / v);
      }
    }
    cout << ans << "\n";
  }
}
