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, stair, ele, v;
  cin >> n >> m >> stair >> ele >> v;
  vector<int> list1, list2;
  vector<int>::iterator it;
  list1.push_back(-1e9);
  list1.push_back(1e9);
  list2.push_back(-1e9);
  list2.push_back(1e9);
  for (int i = 1; i <= stair; i++) {
    int u;
    cin >> u;
    list1.push_back(u);
  }
  for (int i = 1; i <= ele; i++) {
    int u;
    cin >> u;
    list2.push_back(u);
  }
  int q;
  cin >> q;
  sort(list1.begin(), list1.end());
  sort(list2.begin(), list2.end());
  for (int i = 1; i <= q; i++) {
    int x1, y1, x2, y2, kq = 1e9;
    cin >> x1 >> y1 >> x2 >> y2;
    if (x1 == x2 && y1 == y2) {
      cout << 0;
      continue;
    }
    if (y1 > y2) {
      swap(x1, x2);
      swap(y1, y2);
    }
    if (!list1.empty()) {
      it = (upper_bound(list1.begin(), list1.end(), x1));
      kq = min(kq, abs(y1 - *(it)) + abs(x1 - x2) + abs(y2 - *(it)));
      it--;
      kq = min(kq, abs(y1 - *(it)) + abs(x1 - x2) + abs(y2 - *(it)));
    }
    if (!list2.empty()) {
      it = (upper_bound(list2.begin(), list2.end(), x1));
      kq = min(kq,
               abs(y1 - *(it)) + (abs(x1 - x2) + v - 1) / v + abs(y2 - *(it)));
      it--;
      kq = min(kq,
               abs(y1 - *(it)) + (abs(x1 - x2) + v - 1) / v + abs(y2 - *(it)));
      cout << kq << '\n';
    }
  }
}
