#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, numStair, numLift, speedLift;
  cin >> n >> m >> numStair >> numLift >> speedLift;
  vector<int> stair(numStair, 0), lift(numLift, 0);
  for (auto &i : stair) cin >> i;
  for (auto &i : lift) cin >> i;
  int q;
  cin >> q;
  while (q--) {
    int x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    if (x1 == x2)
      cout << abs(y2 - y1) << endl;
    else {
      int ans = INT_MAX;
      if (numStair > 0) {
        int s1 = lower_bound(stair.begin(), stair.end(), y1) - stair.begin();
        if (s1 == numStair) s1--;
        ans = abs(y1 - stair[s1]) + abs(y2 - stair[s1]) + abs(x2 - x1);
        s1--;
        if (s1 >= 0)
          ans = min(ans,
                    abs(y1 - stair[s1]) + abs(y2 - stair[s1]) + abs(x2 - x1));
      }
      if (numLift > 0) {
        int s2 = lower_bound(lift.begin(), lift.end(), y1) - lift.begin();
        if (s2 == numLift) s2--;
        ans = min(ans, abs(y1 - lift[s2]) + abs(y2 - lift[s2]) +
                           (abs(x2 - x1) + speedLift - 1) / speedLift);
        s2--;
        if (s2 >= 0)
          ans = min(ans, abs(y1 - lift[s2]) + abs(y2 - lift[s2]) +
                             (abs(x2 - x1) + speedLift - 1) / speedLift);
      }
      cout << ans << endl;
    }
  }
}
