#include <bits/stdc++.h>
template <class T>
inline void amin(T &x, const T &y) {
  if (y < x) x = y;
}
template <class T>
inline void amax(T &x, const T &y) {
  if (x < y) x = y;
}
bool comp(int i, int j) { return i > j; }
using namespace std;
int ceilint(int a, int b) { return a / b + (a % b != 0); }
int main() {
  int n, m, cl, ce, v;
  cin >> n >> m >> cl >> ce >> v;
  set<int> lv;
  for (int i = 0, i_len = (cl); i < i_len; ++i) {
    int l;
    cin >> l;
    lv.insert(l);
  }
  set<int> ev;
  for (int i = 0, i_len = (ce); i < i_len; ++i) {
    int e;
    cin >> e;
    ev.insert(e);
  }
  int q;
  cin >> q;
  for (int i = 0, i_len = (q); i < i_len; ++i) {
    int x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    if (x1 == x2) {
      cout << (abs(y1 - y2)) << endl;
      continue;
    }
    int lowBound = y1;
    int upperBound = y2;
    int minDist = numeric_limits<int>::max();
    set<int>::iterator it = lv.lower_bound(lowBound);
    if (it != lv.begin()) {
      it--;
    }
    if (it != lv.begin()) {
      it--;
    }
    if (it != lv.begin()) {
      it--;
    }
    for (; it != lv.end(); it++) {
      int j = *it;
      int dist = abs(j - y1) + abs(x1 - x2) + abs(j - y2);
      if (dist < minDist) {
        minDist = dist;
      }
      if (lowBound <= j) {
        break;
      }
    }
    int timeElev = (abs(x1 - x2) + v - 1) / v;
    it = ev.lower_bound(lowBound);
    if (it != ev.begin()) {
      it--;
    }
    if (it != ev.begin()) {
      it--;
    }
    if (it != ev.begin()) {
      it--;
    }
    for (; it != ev.end(); it++) {
      int j = *it;
      int dist = abs(j - y1) + timeElev + abs(j - y2);
      if (dist < minDist) {
        minDist = dist;
      }
      if (lowBound <= j) {
        break;
      }
    }
    cout << minDist << endl;
  }
}
