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 n, m, k, l, v, t, h, c, a1, b1, i, j, a, b;
vector<int> vk, vl;
int main() {
  cin >> n >> m >> k >> l >> v;
  for (i = 0; i < k; i++) {
    cin >> a;
    vk.push_back(a);
  }
  sort(vk.begin(), vk.end());
  for (i = 0; i < l; i++) {
    cin >> a;
    vl.push_back(a);
  }
  sort(vl.begin(), vl.end());
  int q;
  cin >> q;
  while (q--) {
    scanf("%d%d%d%d", &b, &a, &b1, &a1);
    vector<int>::iterator itk = lower_bound(vk.begin(), vk.end(), a);
    vector<int>::iterator itl = lower_bound(vl.begin(), vl.end(), a);
    h = abs(b1 - b);
    if (itk != vk.end()) {
      c = *itk;
      t = abs(c - a) + h + abs(c - a1);
    }
    if (itk != vk.begin()) {
      itk--;
      c = *itk;
      t = min(abs(c - a) + h + abs(c - a1), t);
    }
    if (itl != vl.end()) {
      c = *itl;
      t = min(t, abs(c - a) + (h + v - 1) / v + abs(c - a1));
    }
    if (itl != vl.begin()) {
      itl--;
      c = *itl;
      t = min(abs(c - a) + (h + v - 1) / v + abs(c - a1), t);
    }
    printf("%d\n", t);
  }
}
