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;
long long n, m, s, t, x, y, c, d, l, r, q, v, a[100005], b[100005], ans;
void tangga(long long u) {
  ans = min(ans, abs(u - t) + abs(u - y) + abs(x - s));
}
void elevator(long long u) {
  long long tmp = (abs(x - s) + v - 1) / v;
  ans = min(ans, tmp + abs(u - t) + abs(u - y));
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m >> l >> r >> v;
  for (int i = 0; i < l; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < r; i++) {
    cin >> b[i];
  }
  cin >> q;
  for (int rr = 0; rr < q; rr++) {
    cin >> s >> t >> x >> y;
    ans = 1e18;
    c = lower_bound(a, a + l, t) - a;
    d = lower_bound(b, b + r, t) - b;
    if (c != 0) {
      tangga(a[c - 1]);
    }
    if (c != l) {
      tangga(a[c]);
    }
    if (d != 0) {
      elevator(b[d - 1]);
    }
    if (d != r) {
      elevator(b[d]);
    }
    cout << ans << '\n';
  }
}
