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 N = (int)1e6 + 123;
const int MOD = (int)1e9 + 7;
const int inf = (int)5e8;
const long long infll = (long long)1e17;
void solve() {
  int n, m, cl, ce, v;
  cin >> n >> m >> cl >> ce >> v;
  set<int, greater<int>> leftLadder;
  set<int> rightLadder;
  for (int i = 0; i < cl; ++i) {
    int x;
    cin >> x;
    leftLadder.insert(x);
    rightLadder.insert(x);
  }
  set<int, greater<int>> leftLift;
  set<int> rightLift;
  for (int i = 0; i < cl; ++i) {
    int x;
    cin >> x;
    leftLift.insert(x);
    rightLift.insert(x);
  }
  int q;
  cin >> q;
  for (int i = 0; i < q; ++i) {
    int x1, y1;
    cin >> x1 >> y1;
    int x2, y2;
    cin >> x2 >> y2;
    if (y1 > y2) {
      swap(y1, y2);
    }
    int ans = inf;
    if (leftLadder.lower_bound(y1) != leftLadder.end()) {
      int closer = *leftLadder.lower_bound(y1);
      ans = min(ans, abs(closer - y1) + abs(x1 - x2) + abs(closer - y2));
    }
    if (rightLadder.lower_bound(y1) != rightLadder.end()) {
      int closer = *rightLadder.lower_bound(y1);
      ans = min(ans, abs(closer - y1) + abs(x1 - x2) + abs(closer - y2));
    }
    if (leftLift.lower_bound(y1) != leftLift.end()) {
      int closer = *leftLift.lower_bound(y1);
      int dist = abs(x1 - x2);
      ans = min(ans, abs(closer - y1) + (dist + v - 1) / v + abs(closer - y2));
    }
    if (rightLift.lower_bound(x1) != rightLift.end()) {
      int closer = *rightLift.lower_bound(x1);
      int dist = abs(x1 - x2);
      ans = min(ans, abs(closer - y1) + (dist + v - 1) / v + abs(closer - y2));
    }
    cout << ans << endl;
  }
}
int main() {
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
