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;
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
long long power(long long x, long long y) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = res * x;
    y = y >> 1;
    x = x * x;
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n, m, s, e, v;
  cin >> n >> m >> s >> e >> v;
  long long stair[s];
  long long elev[e];
  for (long long i = 0; i < s; i++) {
    cin >> stair[i];
  }
  for (long long i = 0; i < e; i++) {
    cin >> elev[i];
  }
  long long q;
  cin >> q;
  while (q--) {
    long long x1, x2, y1, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    long long ans = INT_MAX;
    if (x1 == x2) {
      cout << abs(y2 - y1) << endl;
      continue;
    }
    long long st = INT_MIN;
    long long start = 0, end = s - 1;
    while (start <= end) {
      long long mid = (start + end) / 2;
      if (y1 - stair[mid] < 0) {
        end = mid - 1;
      } else if (y1 - stair[mid] == 0) {
        st = stair[mid];
        break;
      } else {
        st = max(st, stair[mid]);
        start = mid + 1;
      }
    }
    long long op1 = abs(y1 - st) + abs(x1 - x2) + abs(st - y2);
    st = lower_bound(stair, stair + s, y1) - stair;
    long long op2 = abs(y1 - stair[st]) + abs(x1 - x2) + abs(stair[st] - y2);
    long long el = INT_MIN;
    start = 0, end = e - 1;
    while (start <= end) {
      long long mid = (start + end) / 2;
      if (y1 - elev[mid] < 0) {
        end = mid - 1;
      } else if (y1 - elev[mid] == 0) {
        st = elev[mid];
        break;
      } else {
        st = max(st, elev[mid]);
        start = mid + 1;
      }
    }
    long long op3 = abs(y1 - el) + abs(x1 - x2) / v + (abs(x1 - x2) % v != 0) +
                    abs(el - y2);
    el = lower_bound(elev, elev + e, y1) - elev;
    long long op4 = abs(y1 - elev[el]) + abs(x1 - x2) / v +
                    (abs(x1 - x2) % v != 0) + abs(elev[el] - y2);
    cout << min(op1, min(op2, min(op3, op4))) << endl;
  }
}
