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 bisect
import math
from sys import stdin, stdout

def close(arr,x):
    p = bisect.bisect_left(arr,x)
    if p == 0:
        return p;
    if p == len(arr):
        return p - 1
    if abs(arr[p - 1] - x) < abs(arr[p] - x):
        return p - 1
    return p

n, m, cL, ce, v = [int(x) for x in input().split()]
L = [int(x) for x in stdin.readline().split()]
e = [int(x) for x in stdin.readline().split()]
q = int(input())

for tt in range(0,q):
    fa,sa,fb,sb = [int(x) for x in stdin.readline().split()]
    #stair
    wL = math.inf
    wE = math.inf
    if cL != 0:
        p = close(L,sa)
        wL = abs(sa - L[p]) + abs(fa - fb) + abs(sb - L[p])
    #elevator
    if ce != 0:
        p = close(e,sa)
        wE = abs(sa - e[p]) + math.ceil(abs(fa - fb)/(v*1.0)) + abs(sb - e[p])
    stdout.write(str(min(wL,wE)) +'\n')
