#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;
  }
}
