import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }
T[] ARR(T = long)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; }
size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
bool minimize(T)(ref T x, T y) { if (x > y) { x = y; return true; } else { return false; } }
bool maximize(T)(ref T x, T y) { if (x < y) { x = y; return true; } else { return false; } }

long mod = 10^^9 + 7;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

void main()
{	
	auto N = RD;
	auto M = RD;
	auto edges = new long[][](N);
	foreach (i; 0..M)
	{
		auto p = RD-1;
		auto q = RD-1;
		edges[p] ~= q;
		edges[q] ~= p;
	}
	auto Q = RD;
	auto ans = new long[2][](Q);
	foreach (i; 0..Q)
	{
		auto a = RD-1;
		long[2][] open = [[a, 0]];
		auto used = new bool[](N);
		used[a] = true;
		long cnt, day;
		while (!open.empty)
		{
			auto n = open.front; open.popFront;
			auto j = n[0];
			auto d = n[1];
			++cnt;
			day = max(day, d);
			foreach (k; edges[j])
			{
				if (used[k]) continue;
				used[k] = true;
				open ~= [k, d+1];
			}
		}
		ans[i] = [cnt-1, day-1];
	}

	foreach (e; ans)
	{
		debug writeln("e[1]:", e[1]);
		auto d = e[1];
		long x = 1;
		long cnt;
		while (x <= d)
		{
			x *= 2;
			++cnt;
		}

		writeln(e[0], " ", e[0] == 0 ? 0 : cnt);
	}
	stdout.flush();
	debug readln();
}