#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll =  long long ;
using P = pair<int,int> ;
const ll INF = 1e14;
const int MOD = 1000000007;
int n = 100005;
vector<ll> bin_(n);

void init(){
    rep(i,n+1) bin_[i] = i;
    rep(i,n) bin_[i+1] += bin_[i];
}

int bin(int d){
    int l = -1,r = n+1;
    while(r - l > 1){
        int m = (l+r)/2;
        if(bin_[m] >= d) r = m;
        else l = m;
    }
    return r;
}

int main(){
    init();
    int m;
    cin >> n >> m;
    vector<vector<int>> graph(n,vector<int>());
    rep(i,m){
        int a,b;
        cin >> a >> b;
        --a;--b;
        graph[a].push_back(b);
        graph[b].push_back(a);
    }  
    int q;
    cin >> q;
    rep(_,q){
        int a;
        cin >> a;
        --a;
        int cnt = 0;
        int d = 0;
        vector<int> day(n,-1);
        queue<int> q;
        q.push(a);
        while(!q.empty()){
            int now = q.front();
            if(now != a) cnt ++;
            q.pop();
            for(int next:graph[now]){
                if(day[next] >= 0 || next == a) continue;
                day[next] = day[now] + 1;
                d = max(d,day[next]);
                q.push(next);
            }
        }
        if(d==-1) d = 0;
        int ans = bin(d);
        cout << cnt << " " << ans  << endl;
    }
}