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 GCC optimize("O3")
using namespace std;
long long n, m, first, second, v, a[100005], b[100005], q, xdddddddddddddddddd,
    ydddddddddddddddddd, x2, y2, ans;
int32_t main() {
  ios_base ::sync_with_stdio(0);
  cin.tie();
  cout.tie();
  cin >> n >> m >> first >> second >> v;
  for (long long i = 1; i <= first; i++) {
    cin >> a[i];
  }
  for (long long i = 1; i <= second; i++) {
    cin >> b[i];
  }
  cin >> q;
  a[n + 1] = 1000000005;
  b[n + 1] = 1000000005;
  for (long long i = 1; i <= q; i++) {
    cin >> xdddddddddddddddddd >> ydddddddddddddddddd >> x2 >> y2;
    auto p = lower_bound(a + 1, a + first + 1, ydddddddddddddddddd);
    auto q = p;
    q--;
    ans = 1000000005;
    ans = min(ans, (abs(ydddddddddddddddddd - *p) + abs(y2 - *p) +
                    abs(xdddddddddddddddddd - x2)));
    ans = min(ans, (abs(ydddddddddddddddddd - *q) + abs(y2 - *q) +
                    abs(xdddddddddddddddddd - x2)));
    p = lower_bound(b + 1, b + first + 1, ydddddddddddddddddd);
    q = p;
    q--;
    ans = min(ans, (abs(ydddddddddddddddddd - *p) + abs(y2 - *p) +
                    (abs(xdddddddddddddddddd - x2) + v - 1) / v));
    ans = min(ans, (abs(ydddddddddddddddddd - *q) + abs(y2 - *q) +
                    (abs(xdddddddddddddddddd - x2) + v - 1) / v));
    cout << ans << '\n';
  }
}
