#include <bits/stdc++.h>
using namespace std;
int n, m, cl, ce, v;
int l[100005], e[100005];
int main() {
  scanf("%d%d%d%d%d", &n, &m, &cl, &ce, &v);
  for (int i = 0; i < cl; i++) scanf("%d", &l[i]);
  for (int i = 0; i < ce; i++) scanf("%d", &e[i]);
  int q;
  scanf("%d", &q);
  while (q--) {
    int x1, x2, y1, y2;
    scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
    int now = INT_MAX;
    if (x1 == x2) {
      printf("%d\n", abs(y1 - y2));
      continue;
    }
    int a = lower_bound(l, l + cl, y1) - l;
    int b = lower_bound(l, l + cl, y2) - l;
    if (a > 0)
      now = min(now, abs(y1 - l[a - 1]) + abs(y2 - l[a - 1]) + abs(x1 - x2));
    if (a < cl) now = min(now, abs(y1 - l[a]) + abs(y2 - l[a]) + abs(x1 - x2));
    if (b > 0)
      now = min(now, abs(y1 - l[b - 1]) + abs(y2 - l[b - 1]) + abs(x1 - x2));
    if (b < cl) now = min(now, abs(y1 - l[b]) + abs(y2 - l[b]) + abs(x1 - x2));
    a = lower_bound(e, e + ce, y1) - e;
    b = lower_bound(e, e + ce, y2) - e;
    if (a > 0)
      now = min(now, abs(y1 - e[a - 1]) + abs(y2 - e[a - 1]) +
                         (abs(x1 - x2) - 1) / v + 1);
    if (a < ce)
      now = min(now,
                abs(y1 - e[a]) + abs(y2 - e[a]) + (abs(x1 - x2) - 1) / v + 1);
    if (b > 0)
      now = min(now, abs(y1 - e[b - 1]) + abs(y2 - e[b - 1]) +
                         (abs(x1 - x2) - 1) / v + 1);
    if (b < ce)
      now = min(now,
                abs(y1 - e[b]) + abs(y2 - e[b]) + (abs(x1 - x2) - 1) / v + 1);
    printf("%d\n", now);
  }
  return 0;
}
