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 int MAXN = 1e5 + 7, inf = 1e9 + 7;
long long n, m, a, b, ce, cl, v;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m >> cl >> ce >> v;
  set<long long> sl, se;
  for (int i = 0; i < cl; i++) {
    int x;
    cin >> x;
    se.insert(x);
  }
  for (int i = 0; i < ce; i++) {
    int x;
    cin >> x;
    sl.insert(x);
  }
  int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    long long x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    swap(x1, y1);
    swap(x2, y2);
    auto lel = sl.lower_bound(x1);
    if (sl.lower_bound(x1) != sl.begin()) lel--;
    auto lr = sl.lower_bound(x1);
    long long ans = n + m;
    if (y1 == y2) {
      ans = abs(x2 - x1);
    }
    if (ce)
      ans = min(ans,
                abs(*lel - x1) + abs(*lel - x2) + (abs(y1 - y2) + v - 1) / v);
    if (cl && lr != sl.end()) {
      ans =
          min(ans, abs(*lr - x1) + abs(*lr - x2) + (abs(y1 - y2) + v - 1) / v);
    }
    if (se.lower_bound(x1) != se.begin()) lel = --se.lower_bound(x1);
    lr = se.lower_bound(x1);
    if (ce) ans = min(ans, abs(*lel - x1) + abs(*lel - x2) + abs(y1 - y2));
    if (cl && lr != se.end()) {
      ans = min(ans, abs(*lr - x1) + abs(*lr - x2) + abs(y1 - y2));
    }
    swap(x1, x2);
    swap(y1, y2);
    if (sl.lower_bound(x1) != sl.end()) lel = --sl.lower_bound(x1);
    lr = sl.lower_bound(x1);
    if (ce)
      ans = min(ans,
                abs(*lel - x1) + abs(*lel - x2) + (abs(y1 - y2) + v - 1) / v);
    if (cl && lr != sl.end()) {
      ans =
          min(ans, abs(*lr - x1) + abs(*lr - x2) + (abs(y1 - y2) + v - 1) / v);
    }
    if (se.lower_bound(x1) != se.end()) lel = --se.lower_bound(x1);
    lr = se.lower_bound(x1);
    if (ce) ans = min(ans, abs(*lel - x1) + abs(*lel - x2) + abs(y1 - y2));
    if (cl && lr != se.end()) {
      ans = min(ans, abs(*lr - x1) + abs(*lr - x2) + abs(y1 - y2));
    }
    cout << ans << "\n";
  }
  return 0;
}
