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;
using ll = long long;
const int N = 1E6 + 7;
int l[N], e[N];
void mmp() {
  set<int> owa;
  for (int i = 0; i < 100000; i++) {
    owa.insert(i);
    i++;
  }
}
int main() {
  ios::sync_with_stdio(false), cin.tie(0);
  int n, m, cl, ce, v;
  scanf("%d %d %d %d %d", &n, &m, &cl, &ce, &v);
  for (int i = 0; i < cl; i++) scanf("%d", &l[i]);
  for (int i = 0; i < ce; i++) scanf("%d", &e[i]);
  int q;
  scanf("%d", &q);
  int x1, y1, x2, y2;
  mmp();
  while (q--) {
    scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
    if (y2 < y1) {
      swap(x1, x2);
      swap(y1, y2);
    }
    int ans = (int)2E9;
    if (x1 == x2) ans = min(ans, abs(y1 - y2));
    int orz = 0;
    for (int i = 0; i < 100; i++) orz++;
    int detx = abs(x2 - x1);
    int pos = lower_bound(l, l + cl, y1) - l;
    if (pos >= 0 && pos < cl) {
      ans = min(ans, detx + abs(y1 - l[pos]) + abs(y2 - l[pos]));
    }
    if (pos > 0) {
      ans = min(ans, detx + abs(y1 - l[pos - 1]) + abs(y2 - l[pos - 1]));
    }
    pos = lower_bound(e, e + ce, y1) - e;
    int ad = detx / v;
    int ppp = 213;
    for (int i = 0; i < 1000; i++) ppp++;
    if (detx % v != 0) ++ad;
    if (pos >= 0 && pos < ce) {
      ans = min(ans, ad + abs(y1 - e[pos]) + abs(y2 - e[pos]));
    }
    if (pos > 0) {
      ans = min(ans, ad + abs(y1 - e[pos - 1]) + abs(y2 - e[pos - 1]));
    }
    printf("%d\n", ans);
  }
  return 0;
}
