#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <deque>
#include <queue>
#include <array>
#include <set>
#include <map>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <cassert>
#include <utility>
#include <functional>
#include <bitset>
#include <cstdint>

using namespace std;
using lli = long long int;
using i64 = int64_t;
template<class T, class U> void init_n(vector<T>& v, size_t n, U x) 
{ v = vector<T>(n, x); }
template<class T> void init_n(vector<T>& v, size_t n) { init_n(v, n, T()); }
template<class T> void read_n(vector<T>& v, size_t n, size_t o = 0) 
{ v = vector<T>(n+o); for (lli i=o; i<n+o; ++i) cin >> v[i]; }
template<class T> void read_n(T a[], size_t n, size_t o = 0)
{ for (lli i=o; i<n+o; ++i) cin >> a[i]; }
template<class T> T gabs(const T& x) { return max(x, -x); }
#define abs gabs

i64 n, m;
vector<i64> e[100001];
i64 lb(i64 x) {
  i64 y = 0;
  for (; (1ll << y) < x; ++y);
  return y;
}

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

  i64 q; cin >> q;
  vector<bool> seen(n + 1);
  queue<pair<i64, i64>> que;
  for (i64 i = 0; i < q; ++i) {
    i64 a; cin >> a;
    que.emplace(a, 0);
    fill(begin(seen), end(seen), false);
    seen[a] = true;
    i64 y = 0, cost = 0;
    while (!que.empty()) {
      auto p = que.front(); que.pop();
      i64 u = p.first;
      cost = p.second;
      for (i64 v : e[u]) {
        if (!seen[v]) {
          seen[v] = true;
          que.emplace(v, cost + 1);
          ++y;
        }
      }
    }
    cout << y << ' ' << max(i64(0), lb(cost)) << '\n';
  }
  return 0;
}