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

import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
def solve():
    global n,m,cl,ce,v,L,E,Q,a,b,c,d
    n, m, cl, ce, v = map(int, input().split())

    L = list(map(int, input().split()))
    E = list(map(int, input().split()))
    Q = int(input())

    res = float('inf')
    for q in range(Q):
        a,b,c,d = map(int, input().split())

        if a == c: # same floor
            print(abs(b-d))
            continue

        if cl >= 1:
            tmp = bisect_left(L, b) - 1
            if 0 <= tmp <= (cl-1):
                res = min(calc(L[tmp], True),res)

            tmp = bisect_left(L, b) 
            if 0 <= tmp <= (cl-1):
                res = min(calc(L[tmp], True),res)

        if ce >= 1:
            tmp = bisect_left(E, b) - 1
            if 0 <= tmp <= (ce-1):
                res = min(calc(E[tmp], False),res)

            tmp = bisect_left(E, b)
            if 0 <= tmp <= (ce-1):
                res = min(calc(E[tmp], False),res)
        print(res)

def calc(y, stair=True):
    if stair == True:
        return abs(b-y) + abs(d-y) + abs(a-c)
    else:
        return abs(b-y) + abs(d-y) + math.ceil(abs(a-c)/v)

if __name__ == "__main__":
    solve()
