import sys
sys.setrecursionlimit(20000000)
input = sys.stdin.readline
n,m = map(int,input().split())
g = [[] for i in range(n)]
for i in range(m):
    a,b = map(int,input().split())
    a-=1;b-=1
    g[a].append(b)
    g[b].append(a)
q = int(input())
a = []
for i in range(q):
    a.append(int(input())-1)
kyori = [1<<30]*n
ok = [0]*n
def dfs(x,y):
    for i in g[x]:
        if kyori[i] > y+1:
            kyori[i] = y+1
            ok[i] = 1
            dfs(i,y+1)
for i in range(q):
    b = a[i]
    kyori = [1<<30]*n
    ok = [0]*n
    ok[b] = 1
    kyori[b] = 0
    dfs(b,0)
    ans = 0
    for j in kyori:
        if j != 1<<30:
            ans = max(ans,j)
    if ans == 1:
        ans = 0
    print(sum(ok)-1,(ans+1)//2)