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

from bisect import bisect
n,m,cs,ce,v=map(int,input().split())
s=list(map(int,input().split()))
e=list(map(int,input().split()))
q=int(input())
for i in range(q):
    f1,s1,f2,s2=map(int,input().split())
    ans=n+m*2
    if f1==f2: print(abs(s1-s2))
    else:
        if cs:
            lb=bisect(s,s1)-1
            if lb<0: lb=0
            lb=s[lb]
            ans=min(ans,abs(f1-f2)+abs(lb-s1)+abs(lb-s2))
        if ce:
            lb=bisect(e,s1)-1
            if lb<0: lb=0
            lb=e[lb]
            ans=min(ans,(abs(f1-f2)-1)//v+1+abs(lb-s1)+abs(lb-s2))
        print(ans)





##////////////////      //////        ///////      //             ///////     //  //   //
##////          //    ///   ///     ///    ///     //            ///  ///     ////     //
##////    ////       ///     ///   ///      ///    //           /////////     ////     ///////
##////     /////    ///       /// ///        ///   //          ///    ///     ////     //   //
##//////////////     ///////////   ///////////     //////     ///     ///     //  //   //   //



