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;
void AA() {
  cin.sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
}
int32_t main() {
  AA();
  long long n, m, cl, ce, v;
  cin >> n >> m >> cl >> ce >> v;
  vector<long long> cll(cl), cee(ce);
  for (long long i = 0; i < cl; i++) cin >> cll[i];
  for (long long i = 0; i < ce; i++) cin >> cee[i];
  long long q;
  cin >> q;
  while (q--) {
    long long a, b, c, d;
    cin >> a >> b >> c >> d;
    long long x, ans = LLONG_MAX;
    x = lower_bound(cll.begin(), cll.end(), b) - cll.begin();
    if (x != cll.size())
      ans = min(ans, abs(cll[x] - b) + abs(cll[x] - d) + abs(c - a));
    x = lower_bound(cee.begin(), cee.end(), b) - cee.begin();
    if (x != cee.size())
      ans = min(ans,
                abs(cee[x] - b) + abs(cee[x] - d) + (abs(c - a) + v - 1) / v);
    x = upper_bound(cll.begin(), cll.end(), b) - cll.begin();
    x--;
    if (x != -1) ans = min(ans, abs(cll[x] - b) + abs(cll[x] - d) + abs(c - a));
    x = upper_bound(cee.begin(), cee.end(), b) - cee.begin();
    x--;
    if (x != -1)
      ans = min(ans,
                abs(cee[x] - b) + abs(cee[x] - d) + (abs(c - a) + v - 1) / v);
    cout << ans << "\n";
  }
}
