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 long long MAXN = 1e5 + 5;
long long c[MAXN], e[MAXN];
long long myabs(long long x) {
  if (x < 0) {
    return -x;
  }
  return x;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long n, m, cl, ce, speed;
  long long x1, y1, x2, y2;
  while (cin >> n >> m >> cl >> ce >> speed) {
    for (int i = 1; i <= cl; i++) {
      cin >> c[i];
    }
    for (int i = 1; i <= ce; i++) {
      cin >> e[i];
    }
    int q;
    cin >> q;
    while (q--) {
      cin >> x1 >> y1 >> x2 >> y2;
      if (x1 == x2) {
        printf("%lld\n", myabs(y1 - y2));
        continue;
      }
      long long idx1 = lower_bound(c + 1, c + 1 + cl, y1) - c;
      if (idx1 > cl) {
        idx1 = cl;
      }
      long long ans1 =
          myabs(c[idx1] - y1) + myabs(x1 - x2) + myabs(c[idx1] - y2);
      idx1--;
      if (idx1 >= 1 && idx1 <= cl) {
        ans1 = min(ans1,
                   myabs(c[idx1] - y1) + myabs(x1 - x2) + myabs(c[idx1] - y2));
      }
      long long idx2 = lower_bound(e + 1, e + 1 + ce, y1) - e;
      if (idx2 > ce) {
        idx2 = ce;
      }
      long long ans2 = myabs(e[idx2] - y1) +
                       (long long)((ceil)(myabs(x1 - x2) * 1.0 / speed)) +
                       myabs(e[idx2] - y2);
      idx2--;
      if (idx2 >= 1 && idx2 <= ce) {
        ans2 = min(ans2, myabs(e[idx2] - y1) +
                             (long long)((ceil)(myabs(x1 - x2) * 1.0 / speed)) +
                             myabs(e[idx2] - y2));
      }
      printf("%lld\n", min(ans1, ans2));
    }
  }
}
