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;
using ll = long long;
const ll N = 1e6 + 10;
ll n, m, q, v;
ll kl, ke;
ll l[N];
ll e[N];
void umin(ll &a, ll b) { a = min(a, b); }
signed main() {
  ios::sync_with_stdio(0), cin.tie(0);
  cin >> n >> m;
  cin >> kl >> ke;
  cin >> v;
  for (ll i = 0; i < kl; ++i) {
    cin >> l[i];
  }
  for (ll i = 0; i < ke; ++i) {
    cin >> e[i];
  }
  sort(l, l + kl);
  sort(e, e + ke);
  cin >> q;
  while (q--) {
    ll x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    if (y1 > y2) {
      swap(x1, x2);
      swap(y1, y2);
    }
    ll ans = (ll)1e18;
    auto it = lower_bound(l, l + kl, y1);
    if (it != l + kl) {
      umin(ans, abs(y1 - *it) + abs(y2 - *it) + abs(x1 - x2));
    }
    it = upper_bound(l, l + kl, y2);
    if (it != l) {
      --it;
      umin(ans, abs(y1 - *it) + abs(y2 - *it) + abs(x1 - x2));
    }
    it = lower_bound(e, e + ke, y1);
    if (it != e + ke) {
      umin(ans, abs(y1 - *it) + abs(y2 - *it) + (abs(x1 - x2) + v - 1) / v);
    }
    it = upper_bound(e, e + ke, y2);
    if (it != e) {
      --it;
      umin(ans, abs(y1 - *it) + abs(y2 - *it) + (abs(x1 - x2) + v - 1) / v);
    }
    if (x1 == x2) {
      ans = abs(y1 - y2);
    }
    cout << ans << "\n";
  }
  return 0;
}
