from collections import defaultdict
from collections import deque
import math

class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        group_members = defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members

    def __str__(self):
        return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())

N,M = map(int,input().split())
uf = UnionFind(N+1)
L = []
for i in range(N+1):
    L.append([])
for i in range(M):
    p,q = map(int,input().split())
    uf.union(p,q)
    L[p].append(q)
    L[q].append(p)

def dfs(A):
    P = [0]*(N+1)
    d = deque()
    d.append(A)
    P[A]=1
    cnt = 0
    while len(d):
        dd = deque()
        while len(d):
            for l in L[d.pop()]:
                if P[l]==0:
                    P[l]=1
                    dd.append(l)
        d=dd
        cnt+=1
    if cnt <= 1 :
        return 0
    return math.ceil(math.log2(cnt-1))




Q = int(input())
for i in range(Q):
    A = int(input())
    print(uf.size(A)-1, dfs(A))