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 xi, yi, xf, yf;
int climb(vector<int>& medium, int v) {
  auto lb = lower_bound(medium.begin(), medium.end(), yi);
  int s1, s2;
  bool no_s2 = true;
  if (lb == medium.end()) {
    s1 = *(lb - 1);
  } else if (lb == medium.begin()) {
    s1 = *lb;
  } else {
    s1 = *lb;
    s2 = *(lb - 1);
    no_s2 = false;
  }
  int climb_t = (abs(xf - xi) + v - 1) / v;
  int first = abs(s1 - yi) + climb_t + abs(s1 - yf);
  if (no_s2) {
    return first;
  }
  int second = abs(s2 - yi) + climb_t + abs(s2 - yf);
  return min(first, second);
}
int main() {
  int n, m, s, e, v;
  cin >> n >> m >> s >> e >> v;
  vector<int> stairs(s);
  vector<int> elev(e);
  for (int i = 0; i < s; i++) cin >> stairs[i];
  for (int i = 0; i < e; i++) cin >> elev[i];
  int q;
  cin >> q;
  while (q--) {
    cin >> xi >> yi >> xf >> yf;
    int ret = 1e9;
    if (xi == xf)
      cout << abs(yi - yf) << endl;
    else {
      if (s > 0) ret = climb(stairs, 1);
      if (e > 0) ret = min(ret, climb(elev, v));
      cout << ret << endl;
    }
  }
  return 0;
}
