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 MAX = 1e6 + 10;
int a[100005];
int b[100005];
int main() {
  int n, m, c, d, v, e;
  ios::sync_with_stdio(false);
  while (scanf("%d%d%d%d%d", &n, &m, &c, &d, &v) != EOF) {
    for (int i = 1; i <= c; ++i) scanf("%d", &a[i]);
    for (int i = 1; i <= d; ++i) scanf("%d", &b[i]);
    scanf("%d", &e);
    for (int i = 1; i <= e; ++i) {
      int x1, y1, x2, y2;
      scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
      int sum = 1e9;
      int x = abs(x2 - x1);
      if (x1 == x2)
        cout << abs(y2 - y1) << endl;
      else {
        int p = upper_bound(a + 1, a + c + 1, y1) - a;
        if (p <= c) sum = min(sum, x + abs(y1 - a[p]) + abs(y2 - a[p]));
        if (p > 1) sum = min(sum, x + abs(y1 - a[p - 1]) + abs(y2 - a[p - 1]));
        p = upper_bound(b + 1, b + d + 1, y1) - b;
        if (p <= d)
          sum = min(sum, (x - 1 + v) / v + abs(y1 - b[p]) + abs(y2 - b[p]));
        if (p > 1)
          sum = min(sum,
                    (x - 1 + v) / v + abs(y1 - b[p - 1]) + abs(y2 - b[p - 1]));
        cout << sum << endl;
      }
    }
  }
  return 0;
}
