#change of class
from collections import deque
import math


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

    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 + 1) 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):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())


N, M = map(int, input().split())
graph = [[] for i in range(N+1)]

Uni = UnionFind(N)
for i in range(M):
    p, q = map(int, input().split())
    graph[p].append(q)
    graph[q].append(p)
    Uni.union(p,q)



Q = int(input())
que = []

for _ in range(Q):
    x = int(input())
    que.append(x)


for i in range(Q):
    s_node = que[i]
    visited = [False for i in range(N+1)]
    distance = [float("inf") for i in range(N+1)]
    d = deque()
    e = deque()
    d.append(s_node)
    distance[s_node] = 0
    visited[s_node]=True
    while d:
        while d:
            x = d.popleft()
            for node in graph[x]:
                if visited[node] == False:
                    visited[node] = True
                    distance[node] = distance[x]+1
                    e.append(node)
        if e:
            d = e
            e = deque()
            
    ans = 0
    for node in Uni.members(s_node):
        if node!=s_node:
            ans = max(ans, math.ceil(math.log2(distance[node])))

    print(Uni.size(s_node)-1,ans)