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;
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 st[s], ele[e];
  for (long long i = 0; i < s; i++) cin >> st[i];
  for (long long i = 0; i < e; i++) cin >> ele[i];
  long long q;
  cin >> q;
  while (q--) {
    long long x1, x2, y1, y2;
    cin >> y1 >> x1 >> y2 >> x2;
    long long ans1, ans2, ans3, ans4;
    ans1 = ans2 = ans3 = ans4 = 1e18;
    long long x = lower_bound(st, st + s, x1) - st;
    if (x < s) {
      ans1 = abs(st[x] - x1) + abs(y2 - y1) + abs(x2 - st[x]);
    }
    x = lower_bound(st, st + s, x1) - st - 1;
    if (x >= 0) {
      ans1 = min(ans1, abs(st[x] - x1) + abs(y2 - y1) + abs(x2 - st[x]));
    }
    x = lower_bound(ele, ele + e, x1) - ele;
    if (x < e) {
      ans2 = abs(ele[x] - x1) +
             (long long)ceil(((double)abs(y2 - y1)) / (double)v) +
             abs(x2 - ele[x]);
    }
    x = lower_bound(ele, ele + e, x1) - ele - 1;
    if (x >= 0) {
      ans2 = min(ans2, abs(ele[x] - x1) +
                           (long long)ceil(((double)abs(y2 - y1)) / (double)v) +
                           abs(x2 - ele[x]));
    }
    cout << min(ans1, ans2) << "\n";
  }
}
