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;
const long long N = 1e6 + 5;
long long n, m, stairs, elev, vel;
long long a[N], b[N];
void solve() {
  cin >> n >> m >> stairs >> elev >> vel;
  for (long long i = 1; i <= stairs; i++) cin >> a[i];
  for (long long i = 1; i <= elev; i++) cin >> b[i];
  long long q;
  cin >> q;
  while (q--) {
    long long x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    if (y1 > y2) {
      swap(x1, x2);
      swap(y1, y2);
    }
    long long diff = abs(x2 - x1);
    auto it = lower_bound(a + 1, a + stairs + 1, y1);
    long long index = it - a;
    long long ans = 1e18;
    for (long long j = max(1LL, index - 1); j <= min(stairs, index + 1); j++) {
      ans = min(ans, abs(y1 - a[j]) + diff + abs(y2 - a[j]));
    }
    auto it2 = lower_bound(b + 1, b + elev + 1, y1);
    index = it2 - b;
    long long difftime = (diff + vel - 1) / vel;
    for (long long j = max(1LL, index - 1); j <= min(elev, index + 1); j++) {
      ans = min(ans, abs(y1 - b[j]) + difftime + abs(y2 - b[j]));
    }
    if (diff == 0) {
      ans = abs(y2 - y1);
    }
    cout << ans << "\n";
  }
}
int32_t main() {
  long long tc = 1;
  while (tc--) solve();
}
