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;
using ll = long long;
using pii = pair<int, int>;
const int inf = 5e8;
void solve() {
  int n, m, cl, ce, v;
  cin >> n >> m >> cl >> ce >> v;
  vector<int> stairs(cl + 2), elevators(ce + 2);
  stairs[0] = elevators[0] = -inf;
  stairs.back() = elevators.back() = inf;
  for (int i = 1; i <= cl; i++) {
    cin >> stairs[i];
  }
  for (int i = 1; i <= ce; i++) {
    cin >> elevators[i];
  }
  int q;
  cin >> q;
  while (q--) {
    int x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    if (x1 > x2) swap(x1, x2);
    if (y1 > y2) swap(y1, y2);
    if (x1 == x2)
      cout << y2 - y1 << '\n';
    else {
      auto it_stairs = upper_bound((stairs).begin(), (stairs).end(), y1);
      auto it_elevators =
          upper_bound((elevators).begin(), (elevators).end(), y1);
      cout << y2 - y1 +
                  min(x2 - x1 +
                          min(max(*it_stairs, y2) - y2, y1 - *(it_stairs - 1)) *
                              2,
                      (x2 - x1 + v - 1) / v + min(max(*it_elevators, y2) - y2,
                                                  y1 - *(it_elevators - 1)) *
                                                  2)
           << '\n';
    }
  }
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0);
  int tcs = 1;
  for (int tc = 1; tc <= tcs; tc++) {
    solve();
  }
}
