#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <utility>
#include <tuple>

#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<int, int>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; PPPPP(__VA_ARGS__); cerr << endl; } while(false)
template<typename T> void PPPPP(T t) { cerr << t; }
template<typename T, typename... S> void PPPPP(T t, S... s) { cerr << t << ", "; PPPPP(s...); }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, T b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false; }
template<typename T> void print(T a) { cout << a << endl; }
template<typename T, typename... Ts> void print(T a, Ts... ts) { cout << a << ' '; print(ts...); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
// clang-format on

#include <queue>

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, m;
    cin, n, m;
    vector<vector<int>> G(n);
    REP(i, 0, m) {
        int a, b;
        cin, a, b;
        a--;
        b--;
        G[a].push_back(b);
        G[b].push_back(a);
    }

    auto bfs = [&](int root) -> P {
        vector<bool> used(n, false);
        vector<int> cost(n, -1);
        queue<P> q;  // cost, vertex
        q.emplace(0, root);
        while (q.size()) {
            auto [c, v] = q.front();
            q.pop();
            if (used[v]) continue;
            used[v] = true;
            cost[v] = c;
            for (auto nxt : G[v]) {
                if (used[nxt]) continue;
                q.emplace(c + 1, nxt);
            }
        }
        int res = -1, day = 0;
        REP(i, 0, n) {
            res += used[i];
            chmax(day, cost[i]);
        }
        dump(day);
        int ans = 0;
        while (day > 1) {
            ans++;
            day = (day + 1) / 2;
        }
        return P(res, ans);
    };
    int q;
    cin, q;
    REP(i, 0, q) {
        int a;
        cin, a;
        auto res = bfs(a - 1);
        print(res.first, res.second);
    }

    return 0;
}