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;
long long int _gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return _gcd(b, a % b);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n, m, s, e, v, q, i, x1, y1, x2, y2, ans, x, t1, t2;
  cin >> n >> m >> s >> e >> v;
  vector<long long int> st, el;
  for (i = 0; i < s; ++i) {
    cin >> x;
    st.push_back(x);
  }
  for (i = 0; i < e; ++i) {
    cin >> x;
    el.push_back(x);
  }
  cin >> q;
  while (q--) {
    t1 = t2 = ans = LLONG_MAX;
    cin >> x1 >> y1 >> x2 >> y2;
    if (s) {
      auto it = upper_bound(st.begin(), st.end(), y1);
      if (it != st.end()) {
        t1 = abs(*it - y1);
        t1 += abs(x1 - x2);
        t1 += abs(*it - y2);
      }
      if (it != st.begin()) {
        --it;
        t2 = abs(*it - y1);
        t2 += abs(x1 - x2);
        t2 += abs(*it - y2);
      }
      ans = min(t1, t2);
    }
    if (e) {
      auto it = upper_bound(el.begin(), el.end(), y1);
      if (it != el.end()) {
        t1 = abs(*it - y1);
        if (abs(x1 - x2) % v != 0)
          t1 += abs(x1 - x2) / v + 1;
        else
          t1 += abs(x1 - x2) / v;
        t1 += abs(*it - y2);
      }
      if (it != el.begin()) {
        --it;
        t2 = abs(*it - y1);
        if (abs(x1 - x2) % v != 0)
          t2 += abs(x1 - x2) / v + 1;
        else
          t2 += abs(x1 - x2) / v;
        t2 += abs(*it - y2);
      }
      ans = min({ans, t1, t2});
    }
    cout << ans << '\n';
  }
  return 0;
}
