#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int n,m;cin>>n>>m;
    vector<vector<int>> g(n);
    rep(i,m){
        int u,v;cin>>u>>v;u--,v--;
        g[u].push_back(v);
        g[v].push_back(u);
    }

    vector<int> dis;
    function<void(int,int)> dfs=[&](int pre,int now){
        for(auto to:g[now])if(to!=pre){
            dis[to]=dis[now]+1;
            dfs(now,to);
        }
    };
    int q;cin>>q;
    while(q--){
        dis.assign(n,-1);
        int st;cin>>st;st--;
        dis[st]=0;
        dfs(-1,st);
        int cnt=0;
        rep(i,n)cnt+=(dis[i]>=0);
        cnt--;
        cout<<cnt<<" "<<max(0,*max_element(ALL(dis))-1)<<endl;
    }

    return 0;
}