#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

vector<int> bfs(vector<vector<int>> &graph, int s) {
    int INF = numeric_limits<int>::max();
    vector<int> dist(graph.size(), INF);
    queue<int> q;
    dist[s] = 0, q.push(s);
    while(!q.empty()){
        int u = q.front(); q.pop();
        for(int v : graph[u]) if(dist[v] == INF)
            dist[v] = dist[u] + 1, q.push(v);
    }
    return dist;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int N,M; cin >> N >> M;
    vector<vector<int>> G(N);
    rep(_,M) {
        int p,q; cin >> p >> q; p--; q--;
        G[p].push_back(q);
        G[q].push_back(p);
    }

    int Q; cin >> Q;
    rep(_,Q) {
        int a; cin >> a; a--;
        auto dist = bfs(G, a);
        int cnt = 0, ma = 0;
        rep(i,N) if(dist[i] < 2e9) {
            cnt++;
            ma = max(ma, dist[i]);
        }
        int sma = (ma == 1 ? 0 : (ma + 1) / 2);
        cout << cnt - 1 << " " << sma << "\n";
    }
}