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 sys
import math
import bisect

def closest(l,y):
    idx = bisect.bisect_left(l, y)
    if idx == 0:
        return l[0]
    if idx == len(l):
        return l[-1]
    if l[idx] - y < y - l[idx - 1]:
       return l[idx]
    else:
       return l[idx - 1]

n, m, cl, ce, v = map(int, sys.stdin.readline().strip().split(' '))
if cl > 0:
	stairs = list(map(int, sys.stdin.readline().strip().split(' ')))
else:
	_ = sys.stdin.readline()
if ce > 0:
	elevators = list(map(int, sys.stdin.readline().strip().split(' ')))
else:
	_ = sys.stdin.readline()
q = int(sys.stdin.readline().strip())
for q0 in range(q):
	x1, y1, x2, y2 = map(int, sys.stdin.readline().strip().split(' '))
	ans1 = ans2 = float('inf')
	if cl > 0:
		closest_stairs = closest(stairs, y1)
		ans1 = abs(y1 - closest_stairs)
		ans1 += abs(x2 - x1)
		ans1 += abs(y2 - closest_stairs)
	if ce > 0:
		closest_elevator = closest(elevators, y1)
		ans2 = abs(y1 - closest_elevator)
		ans2 += math.ceil(abs(x2 - x1)/float(v))
		ans2 += abs(y2 - closest_elevator)
	print(int(min(ans1,ans2)))