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>
#pragma comment(linker, "/STACK:64777216")
using namespace std;
const int inf = (int)1e9 + 5;
const long long INF = (long long)5e18 + 5;
void solve() {
  long long n, m, cl, ce, v;
  cin >> n >> m >> cl >> ce >> v;
  vector<long long> l(cl);
  vector<long long> e(ce);
  for (long long i = 0; i < cl; i++) cin >> l[i];
  for (long long i = 0; i < ce; i++) cin >> e[i];
  long long q;
  cin >> q;
  while (q--) {
    long long x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    if (x2 < x1) swap(x1, x2);
    if (y2 < y1) swap(y1, y2);
    if (x1 == x2) {
      cout << (y2 - y1) << endl;
      continue;
    }
    long long ans1 = 0;
    auto l_it = lower_bound(l.begin(), l.end(), y1);
    auto r_it = upper_bound(l.begin(), l.end(), y2);
    if (l_it != r_it)
      ans1 = 0;
    else {
      ans1 = INF;
      if (r_it != l.end()) ans1 = 2 * (*r_it - y2);
      if (l_it != l.begin()) ans1 = min(ans1, 2 * (y1 - *(--l_it)));
    }
    ans1 += (y2 - y1) + (x2 - x1);
    long long ans2 = 0;
    l_it = lower_bound(e.begin(), e.end(), y1);
    r_it = upper_bound(e.begin(), e.end(), y2);
    if (l_it != r_it)
      ans2 = 0;
    else {
      ans2 = INF;
      if (r_it != e.end()) ans2 = 2 * (*r_it - y2);
      if (l_it != e.begin()) ans2 = min(ans2, 2 * (y1 - *(--l_it)));
    }
    ans2 += (y2 - y1) + (x2 - x1 + (v - 1)) / v;
    long long ans = min(ans1, ans2);
    cout << ans << endl;
  }
}
int main() {
  string filename = "lazy";
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.precision(15);
  solve();
  (void)0;
  return 0;
}
