from collections import deque

INF = 1 << 60

n, m = map(int, input().split())

g = [[] for _ in range(n)]
for _ in range(m):
  u, v = map(int, input().split())
  u -= 1
  v -= 1
  g[u].append(v)
  g[v].append(u)

q = int(input())
for _ in range(q):
  src = int(input())
  src -= 1

  dist = [INF for _ in range(n)]
  dist[src] = 0
  dq = deque()
  dq.append(src)
  while len(dq) > 0:
    cur = dq.popleft()
    for nxt in g[cur]:
      if dist[nxt] < INF:
        continue
      dist[nxt] = dist[cur] + 1
      dq.append(nxt)

  cnt = 0
  day = - INF
  for v in range(n):
    if v == src:
      continue

    if dist[v] < INF:
      cnt += 1
      if dist[v] >= 2:
        day = max(day, dist[v])

  if day == - INF:
    print(f"{cnt} 0")
  else:
    day = (day - 1).bit_length()
    print(f"{cnt} {day}")