#include <bits/stdc++.h>

using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()

template<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }

template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) { 
    return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type
fill_v(T &t, const V &v) { t=v; }
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }

template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a){
    out<<'('<<a.first<<','<<a.second<<')'; return out;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
    out<<'['; for(T i: a) {out<<i<<',';} out<<']'; return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1<<30;
const ll LLINF = 1LL<<60;
const ll MOD = 1000000007;

signed main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll n, m;
    cin >> n >> m;
    vector<vector<ll>> g(n);
    REP(i, m) {
        ll u, v;
        cin >> u >> v;
        u--, v--;
        g[u].push_back(v);
        g[v].push_back(u);
    }

    ll q;
    cin >> q;
    while(q--) {
        ll s;
        cin >> s;
        s--;

        vector<ll> dist(n, LLINF);
        dist[s] = 0;
        priority_queue<PII, vector<PII>, greater<PII>> que;
        que.push({dist[s], s});
        while(que.size()) {
            PII p = que.top(); que.pop();
            if(p.first > dist[p.second]) continue;
            for(auto to: g[p.second]) {
                if(dist[to] > dist[p.second] + 1) {
                    dist[to] = dist[p.second] + 1;
                    que.push({dist[to], to});
                }
            }
        }

        // cout << dist << endl;
        ll num = 0, ma = 1;
        REP(i, n) if(dist[i] != LLINF && i != s) num++, chmax(ma, dist[i]);
        ll d = 1, day = 0;
        while(d < ma) {
            d *= 2;
            day++;
        }
        cout << num << " " << day << endl;
    }

    return 0;
}