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;
long long int ll_max(long long int a, long long int b, long long int c) {
  return max(a, max(b, c));
}
int int_max(int a, int b, int c) { return max(a, max(b, c)); }
long long int ll_min(long long int a, long long int b, long long int c) {
  return min(a, min(b, c));
}
int int_min(int a, int b, int c) { return min(a, min(b, c)); }
long long int max(int a, long long int b) { return max((long long int)a, b); }
long long int min(int a, long long int b) { return min((long long int)a, b); }
long long int min(long long int a, int b) { return min(a, (long long int)b); }
long long int max(long long int a, int b) { return max(a, (long long int)b); }
long long int dx[] = {0, 0, 1, -1};
long long int dy[] = {1, -1, 0, 0};
long long int power(long long int x, long long int y, long long int m) {
  if (y == 0) return 1;
  long long int a = power(x, y / 2, m);
  if (y % 2) {
    return (a * ((a * x) % m)) % m;
  } else {
    return (a * a) % m;
  }
}
long long int mod_inverse(long long int x, long long int m) {
  return power(x, m - 2, m);
}
long long int fact(long long int n, long long int m) {
  if (n <= 1) return 1;
  return (fact(n - 1, m) * n) % m;
}
long long int ncr(long long int n, long long int r, long long int m) {
  if (r > n) return 0;
  long long int n1 = 1, d1 = 1, d2 = 1;
  n1 = fact(n, m);
  d1 = fact(r, m);
  d2 = fact(n - r, m);
  long long int ans = mod_inverse((d1 * d2) % m, m);
  ans = (ans * n1) % m;
  return ans;
}
int gcd(int a, int b) {
  if (a < b) return gcd(b, a);
  if (a % b == 0) return b;
  return gcd(b, a % b);
}
int ispal(string s) {
  int len = s.size();
  int flag = 1;
  for (int i = 0; i < len; ++i) {
    if (s[i] != s[len - i - 1]) {
      flag = 0;
      break;
    }
  }
  return flag;
}
long long int sroot(long long int n, long long int low = 1,
                    long long int high = 1e9 + 1) {
  if (low == high) return low;
  if (low == high - 1) {
    if (high * high <= n)
      return high;
    else
      return low;
  }
  long long int mid = (low + high) / 2;
  long long int a = mid * mid;
  if (a > n)
    return sroot(n, low, mid - 1);
  else
    return sroot(n, mid, high);
}
long long int croot(long long int n, long long int low = 1,
                    long long int high = 1e6 + 1) {
  if (low == high) return low;
  if (low == high - 1) {
    if (high * high * high <= n)
      return high;
    else
      return low;
  }
  long long int mid = (low + high) / 2;
  long long int a = mid * mid * mid;
  if (a > n)
    return croot(n, low, mid - 1);
  else
    return croot(n, mid, high);
}
bool sortbysec(const pair<long long int, long long int> &a,
               const pair<long long int, long long int> &b) {
  return (a.second < b.second);
}
int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(NULL);
  std::cout.tie(NULL);
  long long int n, m, st, el, v;
  cin >> n >> m >> st >> el >> v;
  map<long long int, long long int> ms, me;
  long long int stair[st], elev[el];
  for (long long int i = 0; i < st; i++) {
    cin >> stair[i];
    ms[stair[i]]++;
  }
  for (long long int i = 0; i < el; i++) {
    cin >> elev[i];
    me[elev[i]]++;
  }
  long long int q;
  cin >> q;
  while (q--) {
    long long int x1, y1, x2, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    if (x1 == x2)
      cout << abs(y1 - y2) << endl;
    else {
      long long int cs1 = -1, cs2 = -1, ce1 = -1, ce2 = -1;
      long long int low = y1, high = m, mid;
      long long int b = (upper_bound(stair, stair + st, y1)) - stair;
      if (b != st) {
        cs2 = *(upper_bound(stair, stair + st, y1));
      }
      long long int b2 = (upper_bound(elev, elev + el, y1)) - elev;
      if (b2 != el) {
        ce2 = *(upper_bound(elev, elev + el, y1));
      }
      low = 0, high = st - 1, mid;
      while (low <= high) {
        mid = (low + high) / 2;
        if (stair[mid] > y1)
          high = mid - 1;
        else
          cs1 = stair[mid], low = mid + 1;
      }
      low = 0, high = el - 1, mid;
      while (low <= high) {
        mid = (low + high) / 2;
        if (elev[mid] > y1)
          high = mid - 1;
        else
          ce1 = elev[mid], low = mid + 1;
      }
      long long int ans = LLONG_MAX;
      long long int left = LLONG_MAX, right = LLONG_MAX;
      if (cs1 != -1) left = abs(y1 - cs1) + abs(x2 - x1) + abs(cs1 - y2);
      if (cs2 != -1) right = abs(y1 - cs2) + abs(x2 - x1) + abs(cs2 - y2);
      ans = ll_min(ans, left, right);
      left = LLONG_MAX, right = LLONG_MAX;
      if (ce1 != -1)
        left = abs(y1 - ce1) + ceil((abs(x2 - x1) * 1.0) / (v * 1.0)) +
               abs(ce1 - y2);
      if (ce2 != -1)
        right = abs(y1 - ce2) + ceil((abs(x2 - x1) * 1.0) / (v * 1.0)) +
                abs(ce2 - y2);
      ans = ll_min(ans, left, right);
      cout << ans << endl;
    }
  }
  return 0;
}
