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 main() {
  int n, m, cl, ce, v;
  cin >> n >> m >> cl >> ce >> v;
  vector<int> l(cl), e(ce);
  for (int i = 0; i < cl; i++) cin >> l[i];
  for (int i = 0; i < ce; i++) cin >> e[i];
  int q;
  cin >> q;
  while (q--) {
    int x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    long long int min1 = 1e15;
    if (x1 == x2) min1 = abs(y2 - y1);
    int L = 0, H = cl - 1, al1 = -1;
    while (L <= H) {
      int mid = (L + H) / 2;
      if (l[mid] > y1) {
        al1 = mid;
        H = mid - 1;
      } else
        L = mid + 1;
    }
    if (al1 != -1) {
      min1 =
          min(min1, 1ll * abs(l[al1] - y1) + abs(l[al1] - y2) + abs(x1 - x2));
    }
    L = 0, H = cl - 1, al1 = -1;
    while (L <= H) {
      int mid = (L + H) / 2;
      if (l[mid] < y1) {
        al1 = mid;
        L = mid + 1;
      } else
        H = mid - 1;
    }
    if (al1 != -1) {
      min1 =
          min(min1, 1ll * abs(l[al1] - y1) + abs(l[al1] - y2) + abs(x1 - x2));
    }
    L = 0, H = ce - 1, al1 = -1;
    while (L <= H) {
      int mid = (L + H) / 2;
      if (e[mid] > y1) {
        al1 = mid;
        H = mid - 1;
      } else
        L = mid + 1;
    }
    if (al1 != -1)
      min1 = min(min1, 1ll * abs(e[al1] - y1) + abs(e[al1] - y2) +
                           (abs(x1 - x2) - 1) / v + 1);
    L = 0, H = ce - 1, al1 = -1;
    while (L <= H) {
      int mid = (L + H) / 2;
      if (e[mid] < y1) {
        al1 = mid;
        L = mid + 1;
      } else
        H = mid - 1;
    }
    if (al1 != -1)
      min1 = min(min1, 1ll * abs(e[al1] - y1) + abs(e[al1] - y2) +
                           (abs(x1 - x2) - 1) / v + 1);
    cout << min1 << endl;
  }
  return 0;
}
