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 + 2;
long long n, m, x, y, v, q;
vector<long long> ct, Tm;
signed main() {
  cin >> n >> m >> x >> y >> v;
  for (long long i = 0; i < x; ++i) {
    long long a;
    cin >> a;
    ct.push_back(a);
  }
  for (long long i = 0; i < y; ++i) {
    long long a;
    cin >> a;
    Tm.push_back(a);
  }
  cin >> q;
  while (q--) {
    long long x1, y1, x2, y2, ans = 1e18;
    cin >> x1 >> y1 >> x2 >> y2;
    if (y1 > y2) swap(y1, y2);
    if (x1 == x2)
      ans = abs(y1 - y2);
    else {
      long long pos = lower_bound(ct.begin(), ct.end(), y1) - ct.begin();
      if (pos < ct.size()) {
        ans = min(ans, abs(x1 - x2) + abs(ct[pos] - y1) + abs(ct[pos] - y2));
        if (pos)
          ans = min(ans, abs(x1 - x2) + abs(ct[pos - 1] - y1) +
                             abs(ct[pos - 1] - y2));
      } else {
        if (pos)
          ans = min(ans, abs(x1 - x2) + abs(ct[pos - 1] - y1) +
                             abs(ct[pos - 1] - y2));
      }
      pos = lower_bound(Tm.begin(), Tm.end(), y1) - Tm.begin();
      if (pos < Tm.size()) {
        ans = min(ans, (abs(x1 - x2) + v - 1) / v + abs(Tm[pos] - y1) +
                           abs(Tm[pos] - y2));
        if (pos)
          ans = min(ans, (abs(x1 - x2) + v - 1) / v + abs(Tm[pos - 1] - y1) +
                             abs(Tm[pos - 1] - y2));
      } else {
        if (pos)
          ans = min(ans, (abs(x1 - x2) + v - 1) / v + abs(Tm[pos - 1] - y1) +
                             abs(Tm[pos - 1] - y2));
      }
    }
    cout << ans << endl;
  }
}
