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 n, m, c1, c2, v, ans, q, x1, y1, x2, y2;
vector<int> stairs, elevators;
int main(){
    ios::sync_with_stdio(0), cin.tie(0);
#ifndef ONLINE_JUDGE
//    freopen("in.txt", "r", stdin);
#endif // ONLINE_JUDGE
    cin >> n >> m >> c1 >> c2 >> v;
    stairs.resize(c1);
    for(int i = 0; i < c1; ++i) cin >> stairs[i];
    elevators.resize(c2);
    for(int i = 0; i < c2; ++i) cin >> elevators[i];
    cin >> q;
    while(q--){
        ans = INT_MAX;
        cin >> x1 >> y1 >> x2 >> y2;
        auto str = upper_bound(stairs.begin(), stairs.end(), y1);
        if(str != stairs.end())
            ans = abs(x2-x1)+abs(y1-(*str))+abs(y2-(*str));
        --str;
        if(!stairs.empty() && str >= stairs.begin())
            ans = min(ans, abs(x2-x1)+abs(y1-(*str))+abs(y2-(*str)));
        auto ele = upper_bound(elevators.begin(), elevators.end(), y1);
        if(ele != elevators.end())
            ans = min(ans, (int)ceil(double(abs(x1-x2))/v)+abs(y1-(*ele))+abs(y2-(*ele)));
        --ele;
        if(!elevators.empty() && ele >= elevators.begin())
            ans = min(ans, (int)ceil(double(abs(x1-x2))/v)+abs(y1-(*ele))+abs(y2-(*ele)));
        cout << ans << '\n';
    }
    return 0;
}
