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() {
  long long int n, m, s, e, v, i;
  cin >> n >> m >> s >> e >> v;
  vector<long long int> sta(s);
  vector<long long int> ele(e);
  for (i = 0; i < s; i++) cin >> sta[i];
  for (i = 0; i < e; i++) cin >> ele[i];
  long long int t;
  cin >> t;
  while (t--) {
    long long int x1, x2, y1, y2, a;
    cin >> x1 >> y1 >> x2 >> y2;
    long long int ans = INT_MAX;
    if (x1 == x2)
      ans = abs(y1 - y2);
    else {
      if (s != 0) {
        a = lower_bound(sta.begin(), sta.end(), y1) - sta.begin();
        if (a == s)
          ans = min(ans,
                    abs(y1 - sta[a - 1]) + abs(y2 - sta[a - 1]) + abs(x2 - x1));
        else {
          ans = min(ans, abs(y1 - sta[a]) + abs(y2 - sta[a]) + abs(x2 - x1));
          if (a - 1 >= 0)
            ans = min(ans, abs(y1 - sta[a - 1]) + abs(y2 - sta[a - 1]) +
                               abs(x2 - x1));
        }
      }
      if (e != 0) {
        a = lower_bound(ele.begin(), ele.end(), y1) - ele.begin();
        if (a == e)
          ans = min(ans, abs(y1 - ele[a - 1]) + abs(y2 - ele[a - 1]) +
                             (long long int)ceil(abs(x2 - x1) / (v * 1.0)));
        else {
          ans = min(ans, abs(y1 - ele[a]) + abs(y2 - ele[a]) +
                             (long long int)ceil(abs(x2 - x1) / (v * 1.0)));
          if (a - 1 >= 0)
            ans = min(ans, abs(y1 - ele[a - 1]) + abs(y2 - ele[a - 1]) +
                               (long long int)ceil(abs(x2 - x1) / (v * 1.0)));
        }
      }
    }
    cout << ans << endl;
  }
}
