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 = 1e9;
int main() {
  ios_base::sync_with_stdio(false);
  int n, m, cl, ce, v;
  cin >> n >> m >> cl >> ce >> v;
  vector<int> acl(cl);
  for (int &x : acl) {
    cin >> x;
  }
  vector<int> ace(ce);
  for (int &x : ace) {
    cin >> x;
  }
  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 ans = INF;
      {
        int pos = lower_bound(begin(acl), end(acl), y1) - begin(acl);
        if (pos < cl) {
          ans =
              min(ans, abs(acl[pos] - y1) + abs(acl[pos] - y2) + abs(x2 - x1));
        }
        --pos;
        if (pos >= 0) {
          ans =
              min(ans, abs(acl[pos] - y1) + abs(acl[pos] - y2) + abs(x2 - x1));
        }
      }
      {
        int pos = lower_bound(begin(ace), end(ace), y1) - begin(ace);
        if (pos < ce) {
          ans = min(ans, abs(ace[pos] - y1) + abs(ace[pos] - y2) +
                             (abs(x2 - x1) - 1) / v + 1);
        }
        --pos;
        if (pos >= 0) {
          ans = min(ans, abs(ace[pos] - y1) + abs(ace[pos] - y2) +
                             (abs(x2 - x1) - 1) / v + 1);
        }
      }
      cout << ans << "\n";
    }
  }
  return 0;
}
