#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N,M,Q;
vector<int> E[101010];
int D[101010];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>M;
	FOR(i,M) {
		cin>>x>>y;
		E[x].push_back(y);
		E[y].push_back(x);
	}
	cin>>Q;
	FOR(i,Q) {
		cin>>x;
		FOR(j,N) D[j+1]=1<<20;
		int num=0,ma=0;
		D[x]=0;
		queue<int> QQ;
		QQ.push(x);
		while(QQ.size()) {
			y=QQ.front();
			QQ.pop();
			num++;
			ma=max(ma,D[y]);
			FORR(e,E[y]) if(D[e]>D[y]+1) {
				D[e]=D[y]+1;
				QQ.push(e);
			}
		}
		int ret=0;
		while(1<<ret<ma) ret++;
		cout<<num-1<<" "<<ret<<endl;
	}
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}