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 main() {
  int n, m, cl, ce, v;
  scanf("%d %d %d %d %d", &n, &m, &cl, &ce, &v);
  vector<int> sta(cl), ele(ce);
  for (int i = 0; i <= cl - 1; ++i) {
    scanf("%d", &sta[i]);
  }
  for (int i = 0; i <= ce - 1; ++i) {
    scanf("%d", &ele[i]);
  }
  int q;
  scanf("%d", &q);
  while (q--) {
    int x1, x2, y1, y2;
    scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
    if (x1 == x2) {
      printf("%d\n", abs(y1 - y2));
      continue;
    }
    vector<int> temp;
    int stin = lower_bound(sta.begin(), sta.end(), y1) - sta.begin();
    int elin = lower_bound(ele.begin(), ele.end(), y1) - ele.begin();
    if (stin < cl) {
      temp.push_back(abs(sta[stin] - y1) + abs(x1 - x2) + abs(y2 - sta[stin]));
    }
    if (stin) {
      temp.push_back(abs(sta[stin - 1] - y1) + abs(x1 - x2) +
                     abs(y2 - sta[stin - 1]));
    }
    if (elin < ce) {
      temp.push_back(abs(ele[elin] - y1) + (int)ceil((double)abs(x1 - x2) / v) +
                     abs(ele[elin] - y2));
    }
    if (elin) {
      temp.push_back(abs(ele[elin - 1] - y1) +
                     (int)ceil((double)abs(x1 - x2) / v) +
                     abs(ele[elin - 1] - y2));
    }
    sort(temp.begin(), temp.end());
    printf("%d\n", temp[0]);
  }
}
