#include <bits/stdc++.h>
using namespace std;
int cll[100010] = {0}, cee[100010] = {0};
int ef(int *a, int l, int r, int x) {
  if (l == r)
    return l;
  else {
    int c = (l + r) / 2;
    if (a[c] < x)
      return ef(a, c + 1, r, x);
    else
      return ef(a, l, c, x);
  }
}
int main() {
  int n, m, cl, ce, v;
  scanf("%d %d %d %d %d", &n, &m, &cl, &ce, &v);
  for (int i = 1; i <= cl; i++) scanf("%d", &cll[i]);
  for (int i = 1; i <= ce; i++) scanf("%d", &cee[i]);
  int q;
  scanf("%d", &q);
  while (q--) {
    int x1, y1, x2, y2;
    scanf("%d %d %d %d", &y1, &x1, &y2, &x2);
    if (x1 > x2) swap(x1, x2);
    if (y1 > y2) swap(y1, y2);
    int l1, l2, d1, d2, ll = 1000000000, dd = 1000000000;
    if (y1 != y2) {
      if (cl != 0) {
        l1 = ef(cll, 0, cl + 1, x1);
        l2 = ef(cll, 0, cl + 1, x2);
        if (l1 < l2)
          ll = x2 - x1 + y2 - y1;
        else {
          if (l1 > 1 && l2 <= cl)
            ll = min(x2 - x1 + y2 - y1 + (x1 - cll[l1 - 1]) * 2,
                     x2 - x1 + y2 - y1 + (cll[l2] - x2) * 2);
          else if (l1 > 1)
            ll = x2 - x1 + y2 - y1 + (x1 - cll[l1 - 1]) * 2;
          else if (l2 <= cl)
            ll = x2 - x1 + y2 - y1 + (cll[l2] - x2) * 2;
        }
      }
      if (ce != 0) {
        d1 = ef(cee, 0, ce + 1, x1);
        d2 = ef(cee, 0, ce + 1, x2);
        if (d1 < d2) {
          if ((y2 - y1) % v == 0)
            dd = x2 - x1 + (y2 - y1) / v;
          else
            dd = x2 - x1 + (y2 - y1) / v + 1;
        } else {
          if (d1 > 1 && d2 <= ce) {
            if ((y2 - y1) % v == 0)
              dd = min(x2 - x1 + (y2 - y1) / v + (x1 - cee[d1 - 1]) * 2,
                       x2 - x1 + (y2 - y1) / v + (cee[d2] - x2) * 2);
            else
              dd = min(x2 - x1 + (y2 - y1) / v + (x1 - cee[d1 - 1]) * 2 + 1,
                       x2 - x1 + (y2 - y1) / v + (cee[d2] - x2) * 2 + 1);
          } else if (d1 > 1) {
            if ((y2 - y1) % v == 0)
              dd = x2 - x1 + (y2 - y1) / v + (x1 - cee[d1 - 1]) * 2;
            else
              dd = x2 - x1 + (y2 - y1) / v + (x1 - cee[d1 - 1]) * 2 + 1;
          } else if (d2 <= ce) {
            if ((y2 - y1) % v == 0)
              dd = x2 - x1 + (y2 - y1) / v + (cee[d2] - x2) * 2;
            else
              dd = x2 - x1 + (y2 - y1) / v + (cee[d2] - x2) * 2 + 1;
          }
        }
      }
    } else {
      ll = x2 - x1;
    }
    printf("%d\n", min(ll, dd));
  }
  return 0;
}
