from collections import deque
from math import *
N,M = map(int,input().split())
l = [[]for _ in range(N+1)]

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

Q = int(input())
for _ in range(Q):
  i = int(input())
  que = deque([i])
  check = [-1]*(N+1)
  check[i] = 0
  friends,days = 0,-1
  while que:
    num = que.popleft()
    for j in l[num]:
      if check[j] == -1:
        que.append(j)
        check[j] = check[num]+1
        friends += 1
  ans = 0
  for k in range(1,N+1):
    if check[k] >= 2:
      ans = max(ans,ceil(log2(check[k])))
  print(friends,ans)