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 f(int x, int y, int s, int t, vector<int>& a) {
  if (x == s) return abs(y - t);
  if (a.size() == 0) return INT_MAX / 2;
  if (a.size() == 1) return abs(y - a[0]) + abs(t - a[0]);
  if (t < y) {
    int p;
    p = t;
    t = y;
    y = p;
  }
  int ans;
  auto it = lower_bound(a.begin(), a.end(), y);
  if (it != a.end()) {
    int p = *it;
    ans = abs(p - y) + abs(t - p);
  }
  if (it == a.begin()) return ans;
  it--;
  int p = *it;
  ans = min(ans, y + t - 2 * p);
  return ans;
}
int main() {
  int n, m, cl, ce, v;
  cin >> n >> m >> cl >> ce >> v;
  vector<int> l, e;
  l.resize(cl);
  e.resize(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;
  int x, y, s, t;
  while (q > 0) {
    cin >> x >> y >> s >> t;
    int a = abs(x - s);
    cout << min(f(x, y, s, t, l) + a, f(x, y, s, t, e) + a / v + (a % v > 0))
         << endl;
    q--;
  }
  return 0;
}
