#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, M, Q, A;
    cin >> N >> M;
    vector<vector<int>> graph(N);
    for(int i = 0; i < M; ++i){
        int p, q;
        cin >> p >> q;
        --p, --q;
        graph[p].emplace_back(q);
        graph[q].emplace_back(p);
    }
    vector<int> pow2(26, 1);
    for(int i = 1; i <= 25; ++i)    pow2[i] = pow2[i - 1] * 2;
    cin >> Q;
    for(int q = 0; q < Q; ++q){
        cin >> A;
        --A;
        vector<int> dist(N, INF);
        dist[A] = 0;
        queue<int> que;
        que.emplace(A);
        while(!que.empty()){
            int from = que.front();
            que.pop();
            for(int to : graph[from]){
                if(chmin(dist[to], dist[from] + 1)){
                    que.emplace(to);
                }
            }
        }
        int cnt = 0, max_dist = 0;
        for(int i = 0; i < N; ++i){
            if(i == A || dist[i] == INF)    continue;
            cnt += 1;
            chmax(max_dist, dist[i]);
        }
        int day = lower_bound(begin(pow2), end(pow2), max_dist) - begin(pow2);
        cout << cnt << ' ' << day << '\n';
    }
    
    return 0;
}