import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict
import bisect

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')


def index_lt(a, x):
    'return largest index s.t. A[i] < x or -1 if it does not exist'
    return bisect.bisect_left(a, x) - 1


def index_le(a, x):
    'return largest index s.t. A[i] <= x or -1 if it does not exist'
    return bisect.bisect_right(a, x) - 1


def index_gt(a, x):
    'return smallest index s.t. A[i] > x or len(a) if it does not exist'
    return bisect.bisect_right(a, x)


def index_ge(a, x):
    'return smallest index s.t. A[i] >= x or len(a) if it does not exist'
    return bisect.bisect_left(a, x)


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

Q = int(input())
for _ in range(Q):
    s = int(input())
    s -= 1

    INF = 1 << 30
    C = [INF] * N
    C[s] = 0
    dq = deque([s])
    cnt = 0
    depth = 0
    while len(dq) > 0:
        v = dq.popleft()
        cnt += 1
        depth = max(depth, C[v])
        for d in E[v]:
            if C[d] > C[v] + 1:
                C[d] = C[v] + 1
                dq.append(d)
    print(cnt - 1, math.ceil(math.log2(depth)) if cnt > 2 else 0)