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;
const long long inf = 9223372036854775807LL;
long long power(long long a, long long b) {
  if (b == 0) return 1;
  if (b % 2)
    return a * power(a, b / 2) * power(a, b / 2);
  else
    return power(a, b / 2) * power(a, b / 2);
}
template <typename ForwardIterator, typename T>
ForwardIterator first_less_than(ForwardIterator first, ForwardIterator last,
                                T val) {
  auto it = lower_bound(first, last, val);
  return (it == first ? last : --it);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n, m, cl, ce, v;
  cin >> n >> m >> cl >> ce >> v;
  vector<long long> l(cl), e(ce);
  for (long long &i : l) cin >> i;
  for (long long &i : e) cin >> i;
  long long q;
  cin >> q;
  while (q--) {
    long long x1, x2, y1, y2, ans = inf;
    cin >> x1 >> y1 >> x2 >> y2;
    if (x1 > x2) swap(x1, x2);
    if (y1 > y2) swap(y1, y2);
    long long fe = -1, le = -1, fs = -1, ls = -1;
    auto it1 = lower_bound(l.begin(), l.end(), y1);
    if (it1 != l.end()) fs = *it1;
    auto it2 = first_less_than(l.begin(), l.end(), y2);
    if (it2 != l.end()) ls = *it2;
    auto it3 = lower_bound(e.begin(), e.end(), y1);
    if (it3 != e.end()) fe = *it3;
    auto it4 = first_less_than(e.begin(), e.end(), y2);
    if (it4 != e.end()) le = *it4;
    if (fs != -1) ans = min(ans, abs(x2 - x1) + abs(y2 - fs) + abs(y1 - fs));
    if (ls != -1) ans = min(ans, abs(x2 - x1) + abs(y2 - ls) + abs(y1 - ls));
    if (fe != -1)
      ans = min(ans, (abs(x2 - x1) + v - 1) / v + abs(y2 - fe) + abs(y1 - fe));
    if (le != -1)
      ans = min(ans, (abs(x2 - x1) + v - 1) / v + abs(y2 - le) + abs(y1 - le));
    if (x1 != x2)
      cout << ans << endl;
    else
      cout << abs(y2 - y1) << endl;
  }
  return 0;
}
