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;
int abs(int x) { return x > 0 ? x : -x; }
int time(int* a, int A, int h, int st, int en, int v) {
  if (h == 0) return abs(st - en);
  int p1 = (int)(lower_bound(a, a + A, st) - a);
  int p2 = p1 - 1;
  int ans = 1 << 30;
  if (p1 != A) ans = min(ans, abs(a[p1] - st) + abs(a[p1] - en));
  if (p2 != -1) ans = min(ans, abs(a[p2] - st) + abs(a[p2] - en));
  return ans + (h % v ? h / v + 1 : h / v);
}
int main() {
  int n, m, cs, ce, v;
  cin >> n >> m >> cs >> ce >> v;
  int* s = new int[cs];
  for (int i = 0; i < cs; i++) scanf("%d", s + i);
  int* e = new int[ce];
  for (int i = 0; i < ce; i++) scanf("%d", e + i);
  int q;
  cin >> q;
  while (q--) {
    int x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    int stime = time(s, cs, abs(x2 - x1), y1, y2, 1);
    int etime = time(e, ce, abs(x2 - x1), y1, y2, v);
    printf("%d\n", min(stime, etime));
  }
}
