#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cerr << name << " = " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << " = " << arg1 << " |";
  __f(comma + 1, args...);
}
long long n, m, cl, ce, v, x;
vector<long long> lift, stair;
int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(NULL);
  std::cout.tie(NULL);
  cin >> n >> m >> cl >> ce >> v;
  for (long long i = (0); i < (cl); i++) {
    cin >> x;
    stair.push_back(x);
  }
  for (long long i = (0); i < (ce); i++) {
    cin >> x;
    lift.push_back(x);
  }
  int q;
  cin >> q;
  while (q--) {
    int x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    long long vt = abs(x1 - x2);
    if (vt == 0) {
      cout << abs(y1 - y2) << '\n';
      continue;
    }
    long long ans = 2e18;
    if (lift.size()) {
      auto ix = lower_bound(lift.begin(), lift.end(), y1);
      if (ix == lift.end()) --ix;
      ans = min(ans, abs(*ix - y1) + vt / v + (vt % v ? 1 : 0) + abs(*ix - y2));
      if (ix != lift.begin()) {
        --ix;
        ans =
            min(ans, abs(*ix - y1) + vt / v + (vt % v ? 1 : 0) + abs(*ix - y2));
      }
    }
    if (stair.size()) {
      auto ix = lower_bound(stair.begin(), stair.end(), y1);
      if (ix == stair.end()) --ix;
      ans = min(ans, abs(*ix - y1) + vt + abs(*ix - y2));
      if (ix != stair.begin()) {
        --ix;
        ans = min(ans, abs(*ix - y1) + vt + abs(*ix - y2));
      }
    }
    cout << ans << '\n';
  }
  return 0;
}
