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 = 2e9 + 10;
const long long MOD = 1e9 + 7;
const long double EPS = 1e-9;
const long double PI = acos(-1);
const int M = 1e3 + 10;
const int N = 1e6 + 10;
int a[N], b[N];
long long calc(int y1, int x1, int y2, int x2, int v, int n, int cl, int ce) {
  if (x1 > x2) swap(x1, x2);
  int num = lower_bound(b, b + ce, x1) - b;
  if (num < ce && b[num] < x2) {
    return (x2 - x1) + (max(y2, y1) - min(y2, y1) + v - 1) / v;
  }
  long long ans = INF;
  if (num < ce)
    ans = min(ans, (long long)2 * b[num] - x1 - x2 +
                       (max(y2, y1) - min(y2, y1) + v - 1) / v);
  num--;
  if (num >= 0)
    ans = min(ans, -(long long)2 * b[num] + x1 + x2 +
                       (max(y2, y1) - min(y2, y1) + v - 1) / v);
  num = lower_bound(a, a + cl, x1) - a;
  if (num < cl && a[num] < x2)
    ans = min(ans, (long long)(x2 - x1) + (max(y2, y1) - min(y2, y1)));
  if (num < cl)
    ans = min(ans, (long long)2 * a[num] - x1 - x2 + max(y2, y1) - min(y2, y1));
  num--;
  if (num >= 0)
    ans =
        min(ans, -(long long)2 * a[num] + x1 + x2 + max(y2, y1) - min(y2, y1));
  assert(ans < INF);
  return ans;
}
int main() {
  int n, m, cl, ce, v;
  scanf("%d %d %d %d %d", &n, &m, &cl, &ce, &v);
  for (int i = 0; i < cl; i++) {
    scanf("%d", &a[i]);
  }
  for (int i = 0; i < ce; i++) {
    scanf("%d", &b[i]);
  }
  int q;
  scanf("%d", &q);
  int x1, y1, x2, y2;
  for (int i = 0; i < q; i++) {
    scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
    cout << calc(x1, y1, x2, y2, v, n, cl, ce) << "\n";
  }
}
