#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <cmath>   
#include<cctype>
#include<string>
#include<set>
#include<iomanip>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
using Data = pair<ll, vector<int>>;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 50;
struct edge { ll from; ll to; ll cost; };

vector<int>nxt[101010];
int dist[101010];

void bfs(int now) {
	queue<int>que;
	que.push(now);
	dist[now] = 0;

	while (que.size()) {
		int p = que.front();
		que.pop();
		fore(x, nxt[p]) {
			if (dist[x] == -1) {
				que.push(x);
				dist[x] = dist[p] + 1;
			}
		}
	}
}

int bindigit(int n) {
	int ret = 0;
	while (n > 0) {
		n /= 2;
		ret++;
	}
	return ret;
}


int main() {
	int n, m;
	cin >> n >> m;

	rep(i, 0, m) {
		int p, q;
		cin >> p >> q;
		p--, q--;
		nxt[p].pb(q);
		nxt[q].pb(p);
	}


	int q;
	cin >> q;
	rep(i, 0, q) {
		int a;
		cin >> a;
		a--;
		memset(dist,-1,sizeof(dist));
		bfs(a);
		int temp = 0;
		int cnt = 0;
		rep(i, 0, 101010) {
			temp = max(temp,dist[i]);
			if (dist[i] > 0)cnt++;
		}
		if (temp == 0) {
			cout << 0 << " " << 0 << endl;
		}
		else {
			cout << cnt << " " << bindigit(temp - 1) << endl;
		}
	}



	return 0;
}