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 java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.FilterInputStream;
import java.io.BufferedInputStream;
import java.io.InputStream;

/**
 * @author khokharnikunj8
 */

public class Main {
    public static void main(String[] args) {
        new Thread(null, new Runnable() {
            public void run() {
                new Main().solve();
            }
        }, "1", 1 << 26).start();
    }

    void solve() {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        ScanReader in = new ScanReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        ProblemCStairsAndElevators solver = new ProblemCStairsAndElevators();
        solver.solve(1, in, out);
        out.close();
    }

    static class ProblemCStairsAndElevators {
        public void solve(int testNumber, ScanReader in, PrintWriter out) {
            int n = in.scanInt();
            int m = in.scanInt();
            int stair = in.scanInt();
            int elevator = in.scanInt();
            int v = in.scanInt();
            int stairs[] = new int[stair];
            int elevators[] = new int[elevator];
            in.scanInt(stairs, stair);
            in.scanInt(elevators, elevator);
            int q = in.scanInt();
            while (q-- > 0) {
                int x1 = in.scanInt();
                int y1 = in.scanInt();
                int x2 = in.scanInt();
                int y2 = in.scanInt();
                if (x1 - x2 == 0) {
                    out.println(Math.abs(y1 - y2));
                    continue;
                }
                int rightElevator = CodeHash.ubound(elevators, 0, elevator, y2);
                int leftelevator = rightElevator - 1;
                int rightStair = CodeHash.ubound(stairs, 0, stair, y2);
                int leftStair = rightStair - 1;

                long ans = Long.MAX_VALUE;
                if (rightElevator < elevator) {
                    rightElevator = elevators[rightElevator];
                    ans = Math.min(ans, (long) Math.abs(y1 - rightElevator) + Math.abs(rightElevator - y2) + (long) Math.ceil((double) Math.abs(x1 - x2) / v));
                }
                if (leftelevator >= 0) {
                    leftelevator = elevators[leftelevator];
                    ans = Math.min(ans, (long) Math.abs(y1 - leftelevator) + Math.abs(leftelevator - y2) + (long) Math.ceil((double) Math.abs(x1 - x2) / v));
                }
                if (rightStair < stair) {
                    rightStair = stairs[rightStair];
                    ans = Math.min(ans, (long) Math.abs(y1 - rightStair) + Math.abs(rightStair - y2) + (Math.abs(x1 - x2)));
                }
                if (leftStair >= 0) {
                    leftStair = stairs[leftStair];
                    ans = Math.min(ans, (long) Math.abs(y1 - leftStair) + Math.abs(leftStair - y2) + (Math.abs(x1 - x2)));
                }

                out.println(ans);

            }


        }

    }

    static class CodeHash {
        public static int ubound(int array[], int l, int h, long x) {
            while (l < h) {
                int mid = (l + h) / 2;
                if (array[mid] <= x) l = mid + 1;
                else h = mid;
            }
            return l;
        }

    }

    static class ScanReader {
        private byte[] buf = new byte[4 * 1024];
        private int index;
        private BufferedInputStream in;
        private int total;

        public ScanReader(InputStream inputStream) {
            in = new BufferedInputStream(inputStream);
        }

        private int scan() {
            if (index >= total) {
                index = 0;
                try {
                    total = in.read(buf);
                } catch (Exception e) {
                    e.printStackTrace();
                }
                if (total <= 0) return -1;
            }
            return buf[index++];
        }

        public int scanInt() {
            int integer = 0;
            int n = scan();
            while (isWhiteSpace(n)) n = scan();
            int neg = 1;
            if (n == '-') {
                neg = -1;
                n = scan();
            }
            while (!isWhiteSpace(n)) {
                if (n >= '0' && n <= '9') {
                    integer *= 10;
                    integer += n - '0';
                    n = scan();
                }
            }
            return neg * integer;
        }

        private boolean isWhiteSpace(int n) {
            if (n == ' ' || n == '\n' || n == '\r' || n == '\t' || n == -1) return true;
            else return false;
        }

        public void scanInt(int[] A, int size) {
            for (int i = 0; i < size; i++) A[i] = scanInt();
        }

    }
}

