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;
const int INF = (int)1e9 + 7;
template <class T>
T ceil(T a, T b) {
  return a / b + !!(a % b);
}
int main() {
  int n, m;
  cin >> n >> m;
  int c[2], v[2];
  cin >> c[0] >> c[1] >> v[1];
  v[0] = 1;
  vector<vector<int>> le(2);
  for (int k : {0, 1}) {
    le[k].resize(c[k] + 2);
    le[k].front() = -INF, le[k].back() = INF;
    for (int i = 1; i <= c[k]; i++) cin >> le[k][i];
  }
  int q;
  cin >> q;
  while (q--) {
    int x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    if (x1 == x2) {
      cout << abs(y1 - y2) << endl;
      continue;
    }
    long long ans = INF;
    for (int k : {0, 1}) {
      auto it = lower_bound(begin(le[k]), end(le[k]), y1);
      for (auto pos : {*it, *(it - 1)}) {
        long long tmp = abs(pos - y1) + abs(pos - y2);
        tmp += ceil(abs(x1 - x2), v[k]);
        ans = min(ans, tmp);
      }
    }
    cout << ans << endl;
  }
  return 0;
}
