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

N,M=map(int,input().split())

FRIEND=[list(map(int,input().split())) for i in range(M)]
q=int(input())
Q=[int(input()) for i in range(q)]

EDGELIST=[[] for i in range(N+1)]

for x,y in FRIEND:
    EDGELIST[x].append(y)
    EDGELIST[y].append(x)


for query in Q:
    NQUE=deque()
    check=[0]*(N+1)

    check[query]=1
    for n in EDGELIST[query]:
        check[n]=1
        NQUE.append(n)

    DAY=0

    while NQUE:
        QUE=copy.copy(NQUE)
        NQUE=deque()
        dayflag=0

        while QUE:
            x=QUE.pop()

            for to in EDGELIST[x]:
                if check[to]==1:
                    continue
                NQUE.append(to)
                dayflag=1
                check[to]=1

        if dayflag==1:
            DAY+=1


    print(check.count(1)-1,DAY.bit_length())