#include "bits/stdc++.h"
#define ALL(obj) (obj).begin(),(obj).end()
#define RALL(obj) (obj).rbegin(),(obj).rend()
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define REPR(i, n) for(int i = (int)(n); i >= 0; i--)
#define FOR(i,n,m) for(int i = (int)(n); i < int(m); i++)
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = MOD - 1;
const ll LLINF = 4e18;

//UnionFind
class UnionFind {
private:
    vector<int> par;
public:
    UnionFind(int n) {
        par.resize(n, -1);
    }

    int root(int x) {
        if (par[x] < 0) return x;
        return par[x] = root(par[x]);
    }

    bool unite(int x, int y) {
        int rx = root(x);
        int ry = root(y);
        if (rx == ry) return false;
        if (size(rx) < size(ry)) swap(rx, ry);
        par[rx] += par[ry];
        par[ry] = rx;
        return true;
    }

    bool same(int x, int y) {
        int rx = root(x);
        int ry = root(y);
        return rx == ry;
    }

    int size(int x) {
        return -par[root(x)];
    }
};

vector<vector<int>> G;
vector<bool> visited;

int dist(int v, int p = -1) {
    int res = 0;
    for (int u : G[v]) {
        if (u == p || visited[u]) continue;
        visited[u] = true;
        res = max(res,dist(u, v)+1);
    }
    return res;
}

int f(int n) {
    int res = 0;
    int k = 1;
    while (n > k) {
        res++;
        k <<= 1;
    }
    return res;
}

int main() {
    int n, m; 
    cin >> n >> m;
    UnionFind uni(n);
    G.resize(n);
    visited.resize(n, false);
    REP(i, m) {
        int p, q; cin >> p >> q;
        p--; q--;
        G[p].push_back(q);
        G[q].push_back(p);
        uni.unite(p, q);
    }
    int Q; cin >> Q;
    REP(i, Q) {
        int a; cin >> a;
        a--;
        visited = vector<bool>(n, false);
        cout << uni.size(a)-1 << " " << f(dist(a)) << endl;
    }
    getchar(); getchar();
}