#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int i = ((int)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(int i = ((int)(b));i>=((int)(a));i--)
typedef long long ll;

/*
日数：log(最長距離)
*/

ll n,m,Q,a[100010],g[100010],d[100010];
vector<ll> v[100010],c[100010];

void init(){
	cin>>n>>m;
	rep(i,m){
		ll x,y;
		cin>>x>>y;
		v[x].push_back(y);
		v[y].push_back(x);
	}
	reg(i,1,n)g[i]=-1;
	reg(i,1,n)d[i]=1e18;
	cin>>Q;
	rep(i,Q)cin>>a[i];
}

int main(void){
	init();
	reg(i,1,n){
		if(g[i]==-1){
			g[i]=i;
			c[i].push_back(i);
			queue<ll> Q;
			Q.push(i);
			while(!Q.empty()){
				ll p = Q.front();Q.pop();
				for(ll q:v[p]){
					if(g[q]==-1){
						g[q]=i;
						Q.push(q);
						c[i].push_back(q);
					}
				}
			}
		}
	}
	rep(i,Q){
		//距離の最大値
		ll ans=0,ans2=0;
		rep(j,c[g[a[i]]].size()){
			d[c[g[a[i]]][j]]=1e18;
		}
		d[a[i]]=0;
		queue<ll> Q;
		Q.push(a[i]);
		while(!Q.empty()){
			ll p = Q.front();Q.pop();
			ans=max(ans,d[p]);
			for(ll q:v[p]){
				if(d[q]>d[p]+1){
					d[q]=d[p]+1;
					Q.push(q);
				}
			}
		}
		while(ans>(1<<ans2))ans2++;
		cout<<c[g[a[i]]].size()-1<<" "<<ans2<<endl;
	}
	return 0;
}