import sys
readline = sys.stdin.readline
from collections import deque


def bfs(G, s, N):
    Q = deque([])
    dist = [-1] * N
    par = [-1] * N
    dist[s] = 0
    for u in G[s]:
        par[u] = s
        dist[u] = 1
        Q.append(u)

    while Q:
        u = Q.popleft()
        for v in G[u]:
            if dist[v] != -1:
                continue
            dist[v] = dist[u] + 1
            par[v] = u
            Q.append(v)
            
    return dist


N, M = map(int, readline().split())
G = [[] for i in range(N)]
for i in range(M):
    p, q = map(int, readline().split())
    p, q = p - 1, q - 1
    G[p].append(q)
    G[q].append(p)
    
Q = int(readline())
for _ in range(Q):
    A = int(readline()) - 1
    D = bfs(G, A, N)
    cnt = N - D.count(-1) - 1
    maxv = max(D)
    ans = 0
    now = 1
    while maxv > now:
        ans += 1
        now *= 2
    print(cnt, ans)