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 int INF = 1e9 + 7;
const long long LL_INF = 0x3f3f3f3f3f3f3f3f;
const int maxn = 1e5 + 9;
;
const long long mod = 1e9 + 7;
long long l[maxn], e[maxn];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long n, m, cl, ce, v;
  cin >> n >> m >> cl >> ce >> v;
  for (int i = 1; i <= cl; i++) cin >> l[i];
  for (int i = 1; i <= ce; i++) cin >> e[i];
  int q;
  cin >> q;
  while (q--) {
    long long x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    if (x1 == x2) {
      cout << abs(y1 - y2) << endl;
      continue;
    }
    long long minn = LL_INF;
    int idx;
    idx = upper_bound(l + 1, l + 1 + cl, y1) - l;
    if (1 <= idx && idx <= cl) {
      long long tmp = 0;
      tmp = abs(y1 - l[idx]) + abs(y2 - l[idx]) + abs(x1 - x2);
      minn = min(minn, tmp);
    }
    if (2 <= idx) {
      idx--;
      long long tmp = 0;
      tmp = abs(y1 - l[idx]) + abs(y2 - l[idx]) + abs(x1 - x2);
      minn = min(minn, tmp);
    }
    idx = upper_bound(e + 1, e + 1 + ce, y1) - e;
    if (1 <= idx && idx <= ce) {
      long long tmp = 0;
      tmp = abs(y1 - e[idx]) + abs(y2 - e[idx]) + abs(x1 - x2) / v +
            (abs(x1 - x2) % v == 0 ? 0 : 1);
      minn = min(minn, tmp);
    }
    if (2 <= idx) {
      idx--;
      long long tmp = 0;
      tmp = abs(y1 - e[idx]) + abs(y2 - e[idx]) + abs(x1 - x2) / v +
            (abs(x1 - x2) % v == 0 ? 0 : 1);
      minn = min(minn, tmp);
    }
    cout << minn << endl;
  }
}
