#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/

map<int, set<int>> F;
int N,M,Q,A;
int ans = 0, day=0;

void update(int a) {
    int D[N];
    REP(i,N)D[i]=LONG_LONG_MAX;
    D[a]=-1;
    queue<int> que;
    que.push(a);
    while(!que.empty()) {
        int b = que.front();
        que.pop();
        for (int c:F[b]) {
            int newd = D[b]+1;
            if (D[c]>newd) {
                D[c] = newd;
                que.push(c);
            }
        }
    }
    int ma = -1;
    ans = 0;
    REP(i,N) if (D[i]>=0 && D[i]<LONG_LONG_MAX){
        ma = max(ma, D[i]);
        ans++;
    }
    day = 0;
    while(ma >= (1<<day)) day++;
}

void solve() {
    cin>>N>>M;
    int p,q;
    REP(i,M) {
        cin>>p>>q;
        p--;
        q--;
        F[p].insert(q);
        F[q].insert(p);
    }
    cin>>Q;
    REP(_,Q) {
        cin>>A;
        update(--A);
        out("%lld %lld\n", ans, day);
    }
}