#include <stdio.h>
#include <queue>
#include <vector>
#include <algorithm>

int main() {
    int n, m; scanf("%d%d", &n, &m);
    std::vector<std::vector<int>> g(n);
    for(int i = 0; i < m; i++) {
        int a, b; scanf("%d%d", &a, &b);

        g[a - 1].push_back(b - 1);
        g[b - 1].push_back(a - 1);
    }

    int q; scanf("%d", &q);
    while(q--) {
        int s; scanf("%d", &s); s--;

        std::queue<int> qu; qu.push(s);
        std::vector<int> min_cost(n, 1 << 30); min_cost[s] = 0;
        while(!qu.empty()) {
            auto p = qu.front(); qu.pop();

            for(auto e: g[p]) {
                if(min_cost[p] + 1 >= min_cost[e]) continue;
                min_cost[e] = min_cost[p] + 1;
                qu.push(e);
            }
        }
        
        int ma = 0, count = 0;
        for(auto v: min_cost) {
            if(v == 1 << 30) continue;
            ma = std::max(ma, v - 1);
            count++;
        }

        int log = 0;
        while(ma >> log) log++;
        printf("%d %d\n", count - 1, log);
    }
    return 0;
}