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;
set<int> st, el;
int main() {
  int n, m, cl, ce, v, inp, q;
  int x1, x2, y1, y2;
  scanf("%d %d", &n, &m);
  scanf("%d %d %d", &cl, &ce, &v);
  for (int i = 0; i < cl; i++) {
    scanf("%d", &inp);
    st.insert(inp);
  }
  for (int j = 0; j < ce; j++) {
    scanf("%d", &inp);
    el.insert(inp);
  }
  scanf("%d", &q);
  while (q--) {
    scanf("%d %d", &x1, &y1);
    scanf("%d %d", &x2, &y2);
    if (x1 == x2) {
      cout << abs(y1 - y2) << '\n';
      continue;
    }
    int ans = INT_MAX / 2;
    st.insert(y1);
    set<int>::iterator it = st.find(y1);
    if (it != st.begin()) {
      it--;
      int idx = *it;
      ans = min(ans, abs(idx - y1) + abs(idx - y2) + abs(x2 - x1));
    }
    it = st.find(y1);
    it++;
    if (it != st.end()) {
      int idx = *it;
      ans = min(ans, abs(idx - y1) + abs(idx - y2) + abs(x2 - x1));
    }
    st.erase(y1);
    el.insert(y1);
    it = el.find(y1);
    if (it != el.begin()) {
      it--;
      int idx = *it;
      int upCost = abs(x2 - x1) / v;
      if (abs(x2 - x1) % v) upCost++;
      ans = min(ans, abs(idx - y1) + abs(idx - y2) + upCost);
    }
    it = el.find(y1);
    it++;
    if (it != el.end()) {
      int idx = *it;
      int upCost = abs(x2 - x1) / v;
      if (abs(x2 - x1) % v) upCost++;
      ans = min(ans, abs(idx - y1) + abs(idx - y2) + upCost);
    }
    el.erase(y1);
    cout << ans << '\n';
  }
  return 0;
}
