#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> lpair;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define print2(x,y) cout << (x) << " " << (y) << endl;
#define printa(x,n) for(ll i = 0; i < n; i++){ cout << (x[i]) << " ";} cout<<endl;

ll N,M;
vector<ll> tree[100010];

// Union-Find
struct UnionFind {
private:
    ll N;
    vector<ll> parent;
    vector<ll> num;

public:
    UnionFind(ll n){
        N = n;
        rep(i,0,N) parent.push_back(i);
        rep(i,0,N) num.push_back(1);
    }
    ll root(ll x){
        if(x == parent[x]) return x;
        else return parent[x] = root(parent[x]);
    }
    void unite(ll a, ll b){
        a = root(a); b = root(b);
        if(a == b) return;
        parent[a] = b;
        ll sum = num[a] + num[b];
        num[a] = sum;
        num[b] = sum;
    }
    bool same(ll a, ll b){ return root(a) == root(b);}
    ll sz(ll x){ return num[x];}
};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> N >> M;
    UnionFind uf(100010);
    rep(i,0,M){
        ll p,q;
        cin >> p >> q;
        p--; q--;
        tree[p].push_back(q);
        tree[q].push_back(p);
        uf.unite(p,q);
    }
    ll Q;
    cin >> Q;
    while(Q--){
        ll A;
        cin >> A;
        A--;
        // print(uf.sz(uf.root(A)) - 1);
        priority_queue<lpair, vector<lpair> ,greater<lpair> > pq;
        ll dist[100010] = {};
        rep(i,0,N) dist[i] = INF;
        dist[A] = 0;
        rep(i,0,N) pq.push(make_pair(dist[i], i));
        while(!pq.empty()){
            lpair l1 = pq.top();
            pq.pop();
            for(auto &e: tree[l1.second]){
                if(dist[e] > dist[l1.second] + 1){
                    dist[e] = dist[l1.second] + 1;
                    pq.push(make_pair(dist[e], e));
                }
            }
        }
        // printa(dist, N);
        ll v = 0;
        rep(i,0,N){
            if(dist[i] != INF) v = max(v, dist[i]);
        }
        ll ans = 0;
        if(v == 0 || v == 1){
            ans = 0;
        }else if(v == 2){
            ans = 1;
        }else{
            ans = (v+1)/2;
        }
        cout << uf.sz(uf.root(A)) - 1 << " " << ans << endl;
    }






}