#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std; typedef long double ld; typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define rep(i,n) for(int i=0;i<(n);i++)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define ALL(x) (x).begin(), (x).end()
constexpr int INF=1<<30; constexpr ll LINF=1LL<<60; constexpr ll mod=1e9+7; constexpr int NIL = -1;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
template<class T>inline int popcount(T a) {return __builtin_popcount(a);}
//-------------------
constexpr int MX = 1e5+4;
vector<vector<int>> G(MX);
int n,m;

vector<int> dist(MX, -1);

void bfs(int node) {
    queue<PII> que;
    que.push({node, 0});
    dist[node] = 0;
    while(!que.empty()) {
        auto &[cur, dt] = que.front(); que.pop();
        // dist[cur] = dt;
        for(auto &e: G[cur]) {
            if(dist[e] == -1) {
                dist[e] = dt + 1;
                que.push({e, dt+1});
            }
        }
    }
}

int main() {
    cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(15);
    cin >> n>> m;
    rep(i,m){
        int p,q; cin >> p >> q; p--; q--;
        G[p].push_back(q);
        G[q].push_back(p);
    }

    int Q; cin >> Q;
    while(Q--) {
        dist.assign(MX, -1);
        int a; cin >> a; a--;
        bfs(a);

        int cnt = 0;
        int mx = 0;
        rep(i, n) {
            if(dist[i] != -1) {
                cnt++;
                chmax(mx, dist[i]);
                // cout << dist[i] << endl;
            }
        }
        // cout << mx << endl;
        int num = 1;
        int res = 0;
        while(num < mx) {
            res++;
            num<<=1;
        }
        cout << cnt-1 << " " << res << endl;
    }
    return 0;
}