#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for (int i=(int)(b); i<(int)(e); i++)
#define ALL(x) (x).begin(), (x).end()

const double PI = acos(-1);

const int INF = 1<<28;
int n, m;
vector<int> edges[100000];
int dist[100000];

int ceil_log(int x) {
  int r = log2(x);
  if (1<<r < x)
    ++r;
  return r;
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  cin >> n >> m;
  REP (i, m) {
    int p, q;
    cin >> p >> q;
    --p, --q;
    edges[p].push_back(q);
    edges[q].push_back(p);
  }

  int q;
  cin >> q;
  while (q--) {
    int v;
    cin >> v;
    --v;
    fill(dist, dist + n, INF);

    queue<int> que;
    que.push(v);
    dist[v] = 0;
    int c = 0;
    int d = 0;
    
    while (!que.empty()) {
      int u = que.front();
      que.pop();
      ++c;
      d = max(d, dist[u]);

      for (int w: edges[u]) {
        if (dist[w] == INF) {
          dist[w] = dist[u] + 1;
          que.push(w);
        }
      }
    }

    if (!--c)
      cout << 0 << " " << 0 << endl;
    else
      cout << c << " " << ceil_log(d) << endl;
  }
  
  return 0;
}