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 int maxn = 1e5 + 5;
int l[maxn];
int e[maxn];
int n, m, ce, cl, q, x1, x2, yy1, yy2, v, ans;
int main() {
  while (cin >> n >> m >> cl >> ce >> v) {
    for (int i = 0; i < cl; i++) cin >> l[i];
    for (int i = 0; i < ce; i++) cin >> e[i];
    cin >> q;
    while (q--) {
      ans = 0x3f3f3f3f;
      cin >> yy1 >> x1 >> yy2 >> x2;
      if (yy1 == yy2) {
        cout << abs(yy1 - yy2);
        continue;
      }
      int lt = lower_bound(l, l + cl, x1) - l;
      int dt = lower_bound(e, e + ce, x1) - e;
      if (lt < cl)
        ans = min(ans, abs(l[lt] - x1) + abs(l[lt] - x2) + abs(yy2 - yy1));
      if (lt > 0)
        ans = min(ans,
                  abs(l[lt - 1] - x1) + abs(l[lt - 1] - x2) + abs(yy2 - yy1));
      if (dt < ce)
        ans = min(ans, (int)(abs(e[dt] - x1) + abs(e[dt] - x2) +
                             ceil(abs((1.0 * yy1 - 1.0 * yy2) / (1.0 * v)))));
      if (dt > 0)
        ans = min(ans, (int)(abs(e[dt - 1] - x1) + abs(e[dt - 1] - x2) +
                             ceil(abs((1.0 * yy1 - 1.0 * yy2) / (1.0 * v)))));
      cout << ans << endl;
    }
  }
  return 0;
}
