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;
int n, m, cl, ce, v;
vector<int> st, el;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m >> cl >> ce >> v;
  st.resize(cl), el.resize(ce);
  for (int i = 0; i < cl; i++) cin >> st[i];
  for (int i = 0; i < ce; i++) cin >> el[i];
  int q;
  cin >> q;
  vector<int>::iterator it;
  while (q--) {
    int x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    long long ans = 1e15;
    if (x1 == x2)
      ans = abs(y1 - y2);
    else {
      if (st.size()) {
        it = upper_bound(st.begin(), st.end(), y1);
        if (it != st.end()) {
          ans = abs(*it - y1) + abs(*it - y2) + abs(x1 - x2);
        }
        it = lower_bound(st.begin(), st.end(), y1);
        if (it != st.begin()) {
          it--;
          ans = min(ans, 1ll * abs(*it - y1) + abs(*it - y2) + abs(x1 - x2));
        }
      }
      if (el.size()) {
        it = upper_bound(el.begin(), el.end(), y1);
        if (it != el.end()) {
          long long temp = abs(*it - y1) + abs(*it - y2);
          long long d = abs(x1 - x2) / v;
          if (abs(x1 - x2) % v != 0) d++;
          temp += d;
          ans = min(ans, temp);
        }
        it = lower_bound(el.begin(), el.end(), y1);
        if (it != el.begin()) {
          it--;
          long long temp = abs(*it - y1) + abs(*it - y2);
          long long d = abs(x1 - x2) / v;
          if (abs(x1 - x2) % v != 0) d++;
          temp += d;
          ans = min(ans, temp);
        }
      }
    }
    cout << ans << '\n';
  }
  return 0;
}
