#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 5;
const long long INF = 0x3f3f3f3f;
long long first[N], el[N];
long long find_best(long long x1, long long x2, long long v[], long long n) {
  if (x1 > x2) swap(x1, x2);
  long long bst = INF;
  auto it = lower_bound(v, v + n, x1);
  if (it < v + n and *it <= x2) return 0;
  if (--it >= v) bst = x1 - *it;
  it = lower_bound(v, v + n, x2);
  if (it < v + n) bst = min(bst, *it - x2);
  return 2 * bst;
}
int main() {
  long long n, m, stn, eln, v;
  cin >> n >> m >> stn >> eln >> v;
  for (long long i = 0; i < stn; i++) cin >> first[i];
  for (long long i = 0; i < eln; i++) cin >> el[i];
  sort(first, first + stn);
  sort(el, el + eln);
  long long q;
  cin >> q;
  while (q--) {
    long long x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    long long dy = abs(y1 - y2);
    long long dx = abs(x1 - x2);
    long long bel = find_best(y1, y2, el, eln);
    long long bst = find_best(y1, y2, first, stn);
    long long ans = min(bst + dx + dy, bel + dy + (dx + v - 1) / v);
    if (dx == 0)
      cout << dx + dy << endl;
    else
      cout << ans << endl;
  }
}
