#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <array>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
#include <iterator>
#include <memory>
#include <regex>
using namespace std;

pair<int, int> solve(const vector<vector<int> >& edges, int a)
{
    int n = edges.size();
    vector<bool> isUsed(n, false);
    queue<int> q;
    isUsed[a] = true;
    q.push(a);
    int len = -1;
    int cnt = 0;
    while(!q.empty()){
        ++ len;
        int m = q.size();
        while(--m >= 0){
            int x = q.front();
            q.pop();
            for(int y : edges[x]){
                if(!isUsed[y]){
                    isUsed[y] = true;
                    q.push(y);
                    ++ cnt;
                }
            }
        }
    }

    int day = 0;
    while(len > 1){
        ++ day;
        len = (len + 1) / 2;
    }

    return make_pair(cnt, day);
}

int main()
{
    int n, m;
    cin >> n >> m;
    vector<vector<int> > edges(n);
    for(int i=0; i<m; ++i){
        int p, q;
        cin >> p >> q;
        -- p;
        -- q;
        edges[p].push_back(q);
        edges[q].push_back(p);
    }

    int q;
    cin >> q;
    while(--q >= 0){
        int a;
        cin >> a;
        -- a;
        auto ans = solve(edges, a);
        cout << ans.first << ' ' << ans.second << endl;
    }

    return 0;
}