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 MX = 1e5 + 10;
const int INF = 1e9;
int a[2][MX];
int c[2];
int get(int ind, int y1, int y2) {
  int l = 0, r = c[ind] - 1;
  while (l + 2 < r) {
    int m1 = l + (r - l) / 3;
    int m2 = r - (r - l) / 3;
    int f1 = abs(a[ind][m1] - y1) + abs(a[ind][m1] - y2);
    int f2 = abs(a[ind][m2] - y1) + abs(a[ind][m2] - y2);
    if (f1 > f2)
      l = m1;
    else
      r = m2;
  }
  int ans = abs(a[ind][l] - y1) + abs(a[ind][l] - y2);
  for (int i = l + 1; i <= r; ++i) {
    ans = min(ans, abs(a[ind][i] - y1) + abs(a[ind][i] - y2));
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(nullptr);
  int n, m, v;
  cin >> n >> m >> c[0] >> c[1] >> v;
  for (int i = 0; i < c[0]; ++i) cin >> a[0][i];
  for (int i = 0; i < c[1]; ++i) cin >> a[1][i];
  int q;
  cin >> q;
  while (q--) {
    int x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    if (x1 == x2)
      cout << abs(y1 - y2) << '\n';
    else {
      int ans1 = get(0, y1, y2) + abs(x1 - x2);
      if (!c[0]) ans1 = INF;
      int ans2 = get(1, y1, y2) + (abs(x1 - x2) + v - 1) / v;
      if (!c[1]) ans2 = INF;
      cout << min(ans1, ans2) << '\n';
    }
  }
  return 0;
}
