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 main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, m, s, e, v;
  cin >> n >> m >> s >> e >> v;
  int c[s + 2];
  for (int i = 0; i < s; i++) cin >> c[i];
  int ee[e + 2];
  for (int i = 0; i < e; i++) cin >> ee[i];
  int q;
  cin >> q;
  int x1, y1, x2, y2;
  while (q--) {
    long long ans = 1e9;
    cin >> x1 >> y1 >> x2 >> y2;
    if (x1 == x2) {
      cout << abs(y1 - y2) << endl;
      continue;
    }
    int idx = upper_bound(c, c + s, y1) - c;
    if (idx < s) {
      long long temp = abs(x1 - x2) + abs(c[idx] - y2) + abs(c[idx] - y1);
      ans = min(ans, temp);
    }
    if (idx) {
      long long temp =
          abs(x1 - x2) + abs(c[idx - 1] - y2) + abs(y1 - c[idx - 1]);
      ans = min(ans, temp);
    }
    idx = upper_bound(ee, ee + e, y1) - ee;
    if (idx < e) {
      long long temp =
          (abs(x1 - x2) - 1) / v + 1 + abs(ee[idx] - y2) + abs(ee[idx] - y1);
      ans = min(ans, temp);
    }
    if (idx) {
      long long temp = (abs(x1 - x2) - 1) / v + 1 + abs(ee[idx - 1] - y2) +
                       abs(y1 - ee[idx - 1]);
      ans = min(ans, temp);
    }
    cout << ans << endl;
  }
}
