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 = 1 << 30;
vector<int> ls, es;
int main() {
  int n, m, cl, ce, v;
  scanf("%d%d%d%d%d", &n, &m, &cl, &ce, &v);
  for (int i = 0; i < cl; i++) {
    int li;
    scanf("%d", &li);
    ls.push_back(li);
  }
  for (int i = 0; i < ce; i++) {
    int ei;
    scanf("%d", &ei);
    es.push_back(ei);
  }
  int qn;
  scanf("%d", &qn);
  while (qn--) {
    int x0, y0, x1, y1;
    scanf("%d%d%d%d", &x0, &y0, &x1, &y1);
    if (x0 == x1)
      printf("%d\n", abs(y1 - y0));
    else {
      int mint = INF;
      if (cl > 0) {
        int k = lower_bound(ls.begin(), ls.end(), y0) - ls.begin();
        if (k > 0) {
          int l = ls[k - 1];
          int t = abs(l - y0) + abs(x1 - x0) + abs(y1 - l);
          if (mint > t) mint = t;
        }
        if (k < cl) {
          int l = ls[k];
          int t = abs(l - y0) + abs(x1 - x0) + abs(y1 - l);
          if (mint > t) mint = t;
        }
      }
      if (ce > 0) {
        int k = lower_bound(es.begin(), es.end(), y0) - es.begin();
        if (k > 0) {
          int e = es[k - 1];
          int t = abs(e - y0) + (abs(x1 - x0) + v - 1) / v + abs(y1 - e);
          if (mint > t) mint = t;
        }
        if (k < ce) {
          int e = es[k];
          int t = abs(e - y0) + (abs(x1 - x0) + v - 1) / v + abs(y1 - e);
          if (mint > t) mint = t;
        }
      }
      printf("%d\n", mint);
    }
  }
  return 0;
}
