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 MAX = 100400;
const long long inf = 1e18 + 5;
long long n, m;
long long cl, ce, v;
long long l[MAX], e[MAX];
long long fx, fy, tx, ty;
long long fun(long long r, long long var) {
  if (fx == tx) return abs(fy - ty);
  if (r >= 1 && r <= m)
    return abs(fy - r) + abs(ty - r) + (abs(tx - fx) + var - 1) / var;
  return inf;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> m >> cl >> ce >> v;
  for (long long i = 1; i < cl + 1; i++) cin >> l[i];
  l[cl + 1] = m + 1;
  for (long long i = 1; i < ce + 1; i++) cin >> e[i];
  e[ce + 1] = m + 1;
  long long t;
  cin >> t;
  while (t--) {
    cin >> fx >> fy >> tx >> ty;
    long long lowB = lower_bound(l, l + cl + 2, fy) - l;
    long long ans = min(fun(l[lowB - 1], 1), fun(l[lowB], 1));
    lowB = lower_bound(e, e + ce + 2, fy) - e;
    ans = min(ans, min(fun(e[lowB - 1], v), fun(e[lowB], v)));
    cout << ans << "\n";
  }
  return 0;
}
