import heapq
def dijkstra(s):
    inf = 10**9
    d = [inf]*(N+1)
    used = [0]*(N+1)
    h = [(0, s)]
    while h:
        temp = heapq.heappop(h)
        dist = temp[0]
        u = temp[1]
        if used[u] == 1:
            continue
        used[u] = 1
        d[u] = dist
        for v in E[u]:
            if used[v] == 1:
                continue
            heapq.heappush(h, (dist+1, v))
    return d


N,M = map(int, input().split())
E = [[] for _ in range(N+1)]
for _ in range(M):
    p,q = map(int, input().split())
    E[p].append(q)
    E[q].append(p)

Q = int(input())
for _ in range(Q):
    a = int(input())
    d = dijkstra(a)
    num = -1
    cnt = 0
    for i in range(1, N+1):
        if d[i] == 10**9:
            continue
        cnt = max(cnt, d[i]-1)
        num += 1
    day = 0
    for i in range(1, cnt+1):
        if i*(i-1)//2 < cnt <= i*(i+1)//2:
            day = i
            break
    print(num, day)