2 10 1 1 1
1
10
1
1 5 1 8
 4 4 1 0 1
1

1
1 2 1 4
 2 5 1 0 1
2

1
1 4 1 5
 10 10 1 8 4
10
2 3 4 5 6 7 8 9
10
1 1 3 1
2 1 7 1
1 1 9 1
7 1 4 1
10 1 7 1
2 1 7 1
3 1 2 1
5 1 2 1
10 1 5 1
6 1 9 1
 2 4 1 1 1
1
4
1
1 2 1 3
 2 2 0 1 1

1
1
1 2 2 2
 1000 1000 1 1 10
1
2
1
1 900 1 1000
 5 5 1 1 1
3
2
1
1 5 1 1
 2 4 1 1 1
1
2
1
2 3 2 4
 4 4 1 0 1
4

5
1 1 2 2
1 3 2 2
3 3 4 3
3 2 2 2
1 2 2 3

3
 2
 1
 3
4
4
3
3
4
3
3
4
3
 1
 3
 100
 4
 1
 6
4
3
5
4

#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1e5 + 5;
int n, m, cl, ce, v, q;
vector<int> sta, ele;
int x, y, a, b;
int L, E;
int ans;
inline int nearest(vector<int> &V, int l, int r) {
  auto rtn = lower_bound(V.begin(), V.end(), l);
  if (rtn != V.end() && (l <= (*rtn) && (*rtn) <= r)) return *rtn;
  if (rtn == V.end()) {
    if (rtn == V.begin())
      return -1;
    else
      return *(--rtn);
  }
  if (rtn == V.begin()) return *rtn;
  auto it = rtn;
  it--;
  return abs((*rtn) - r) > abs((*it) - l) ? (*it) : (*rtn);
}
int main() {
  scanf("%d%d%d%d%d", &n, &m, &cl, &ce, &v);
  for (int i = 0, tmp; i < cl; i++) scanf("%d", &tmp), sta.push_back(tmp);
  for (int i = 0, tmp; i < ce; i++) scanf("%d", &tmp), ele.push_back(tmp);
  sort(sta.begin(), sta.end());
  sort(ele.begin(), ele.end());
  scanf("%d", &q);
  while (q--) {
    scanf("%d%d%d%d", &x, &y, &a, &b);
    L = nearest(sta, y, b);
    E = nearest(ele, y, b);
    ans = min(
        L == -1 ? INT_MAX : abs(L - y) + abs(L - b) + abs(x - a),
        E == -1 ? INT_MAX : abs(E - y) + abs(E - b) + (abs(x - a) - 1) / v + 1);
    if (x == a) ans = abs(y - b);
    printf("%d\n", ans);
  }
  return 0;
}
