#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
long long power(long long x, long long y) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = res * x;
    y = y >> 1;
    x = x * x;
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n, m, s, e, v;
  cin >> n >> m >> s >> e >> v;
  long long stair[100005];
  long long elev[100005];
  for (long long i = 0; i < s; i++) {
    cin >> stair[i];
  }
  for (long long i = 0; i < e; i++) {
    cin >> elev[i];
  }
  long long q;
  cin >> q;
  while (q--) {
    long long x1, x2, y1, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    long long ans = INT_MAX;
    if (x1 == x2) {
      cout << abs(y2 - y1) << endl;
      continue;
    }
    long long st = INT_MIN;
    long long start = 0, end = s - 1;
    while (start <= end) {
      long long mid = (start + end) / 2;
      if (y1 - stair[mid] < 0) {
        end = mid - 1;
      } else if (y1 - stair[mid] == 0) {
        st = stair[mid];
        break;
      } else {
        st = max(st, stair[mid]);
        start = mid + 1;
      }
    }
    long long op1 = abs(y1 - st) + abs(x1 - x2) + abs(st - y2);
    long long op2 = INT_MAX;
    if (s > 0) {
      st = lower_bound(stair, stair + s, y1) - stair;
      if (st < s)
        op2 = abs(y1 - stair[st]) + abs(x1 - x2) + abs(stair[st] - y2);
    }
    long long el = INT_MIN;
    start = 0, end = e - 1;
    while (start <= end) {
      long long mid = (start + end) / 2;
      if (y1 - elev[mid] < 0) {
        end = mid - 1;
      } else if (y1 - elev[mid] == 0) {
        el = elev[mid];
        break;
      } else {
        el = max(el, elev[mid]);
        start = mid + 1;
      }
    }
    long long op3 = abs(y1 - el) + abs(x1 - x2) / v + (abs(x1 - x2) % v != 0) +
                    abs(el - y2);
    long long op4 = INT_MAX;
    if (e > 0) {
      el = lower_bound(elev, elev + e, y1) - elev;
      if (el < e)
        op4 = abs(y1 - elev[el]) + abs(x1 - x2) / v + (abs(x1 - x2) % v != 0) +
              abs(elev[el] - y2);
    }
    cout << min(op1, min(op2, min(op3, op4))) << endl;
  }
}
