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;
vector<int> lift, stair;
int main() {
  int n, m, cs, cl, v, i, j, k, p, q, l, r, x, y;
  scanf("%d %d %d %d %d", &n, &m, &cs, &cl, &v);
  for (i = 0; i < cs; i++) {
    scanf("%d", &p);
    stair.push_back(p);
  }
  for (i = 0; i < cl; i++) {
    scanf("%d", &p);
    lift.push_back(p);
  }
  scanf("%d", &q);
  int x1, x2, y1, y2, d, ans, anss, ansl, temp;
  while (q--) {
    scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
    if (x1 == x2) {
      printf("%d\n", abs(y1 - y2));
      continue;
    }
    d = abs(x1 - x2);
    ansl = anss = INT_MAX;
    if (cl) {
      k = lower_bound(lift.begin(), lift.end(), y1) - lift.begin();
      if (k == cl) k--;
      p = lift[k];
      ansl = abs(p - y1) + abs(p - y2) + ((d + v - 1) / v);
      if (k > 0) k--;
      p = lift[k];
      temp = abs(p - y1) + abs(p - y2) + ((d + v - 1) / v);
      ansl = min(temp, ansl);
    }
    if (cs) {
      k = lower_bound(stair.begin(), stair.end(), y1) - stair.begin();
      if (k == cs) k--;
      p = stair[k];
      anss = abs(p - y1) + abs(p - y2) + d;
      if (k > 0) k--;
      p = stair[k];
      temp = abs(p - y1) + abs(p - y2) + d;
      anss = min(temp, anss);
    }
    ans = min(ansl, anss);
    printf("%d\n", ans);
  }
  return 0;
}
