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;
int n, m, cl, ce, v, q;
vector<int> l, e;
int lower(vector<int> &v, int lo, int hi, int x) {
  while (lo <= hi) {
    int mid = (lo + hi) >> 1;
    v[mid] > x ? hi = mid - 1 : lo = mid + 1;
  }
  return hi;
}
int upper(vector<int> &v, int lo, int hi, int x) {
  while (lo <= hi) {
    int mid = (lo + hi) >> 1;
    v[mid] <= x ? lo = mid + 1 : hi = mid - 1;
  }
  return lo;
}
void solve(int testcase) {
  cin >> n >> m >> cl >> ce >> v;
  for (int i = (1); i <= (cl); i++) {
    int x;
    cin >> x;
    l.push_back(x);
  }
  for (int i = (1); i <= (ce); i++) {
    int x;
    cin >> x;
    e.push_back(x);
  }
  cin >> q;
  while (q--) {
    int x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    if (x1 == x2) {
      cout << abs(y1 - y2) << '\n';
      continue;
    }
    vector<int> cost;
    if (((int)l.size()) > 0) {
      int idx = lower(l, 0, ((int)l.size()) - 1, y1);
      if (idx >= 0 && idx < ((int)l.size()) && l[idx] < y1)
        cost.push_back(abs(y1 - l[idx]) + abs(x1 - x2) + abs(l[idx] - y2));
      int idx2 = upper(l, 0, ((int)l.size()) - 1, y1);
      if (idx2 >= 0 && idx2 < ((int)l.size()) && l[idx2] > y1)
        cost.push_back(abs(y1 - l[idx2]) + abs(x1 - x2) + abs(l[idx2] - y2));
    }
    if (((int)e.size()) > 0) {
      int idx = lower(e, 0, ((int)e.size()) - 1, y1);
      if (idx >= 0 && idx < ((int)e.size()) && e[idx] < y1)
        cost.push_back(abs(y1 - e[idx]) + ceil((1.0 * abs(x1 - x2)) / v) +
                       abs(e[idx] - y2));
      int idx2 = upper(e, 0, ((int)e.size()) - 1, y1);
      if (idx2 >= 0 && idx2 < ((int)e.size()) && e[idx2] > y1)
        cost.push_back(abs(y1 - e[idx2]) + ceil((1.0 * abs(x1 - x2)) / v) +
                       abs(e[idx2] - y2));
    }
    sort(cost.begin(), cost.end());
    cout << cost[0] << '\n';
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cout << setprecision(2);
  clock_t b = clock();
  int t = 1;
  for (int tt = (1); tt <= (t); tt++) solve(tt);
  clock_t e = clock();
  cerr << (double(e - b) / CLOCKS_PER_SEC) << " sec";
  return 0;
}
