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>
#pragma comment(linker, "/STACK:200000000")
using namespace std;
mt19937 mt(736);
void solve(istream &cin = std::cin, ostream &cout = std::cout) {
  int n, m, cl, ce, v;
  cin >> n >> m >> cl >> ce >> v;
  vector<int> l(cl), e(ce);
  for (auto &it : l) cin >> it;
  for (auto &it : e) cin >> it;
  int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    int x1, y1, x2, y2;
    cin >> y1 >> x1 >> y2 >> x2;
    int diff = abs(y1 - y2);
    if (x2 < x1) swap(x1, x2);
    int ans = numeric_limits<int>::max();
    if (diff == 0) ans = x2 - x1;
    if (!l.empty()) {
      int wh = lower_bound(l.begin(), l.end(), x1) - l.begin();
      if (wh == l.size() || wh > 0 && max(0, l[wh] - x2) > x1 - l[wh - 1]) wh--;
      ans = min(ans, diff + x2 - x1 + max(0, 2 * max(l[wh] - x2, x1 - l[wh])));
    }
    if (!e.empty()) {
      int wh = lower_bound(e.begin(), e.end(), x1) - e.begin();
      if (wh == e.size() || wh > 0 && max(0, e[wh] - x2) > x1 - e[wh - 1]) wh--;
      ans = min(ans, (diff + v - 1) / v + x2 - x1 +
                         max(0, 2 * max(e[wh] - x2, x1 - e[wh])));
    }
    cout << ans << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  solve();
  return 0;
}
