// template version 1.7

// varibable settings {{{
using namespace std;
#include <iostream>
#include <bits/stdc++.h>

#define int long long
#define INF 1e18
// #define INF 2147483647
#define MOD 1e9+7
#define infile "../test/sample-1.in"
int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};
#define fi first
#define se second

// }}}

// define basic macro {{{
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define _rrep(i,n) rrepi(i,0,n)
#define rrepi(i,a,b) for(int i=(int)(b-1);i>=(int)(a);--i)
#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define uni(x) sort(all(x));x.erase(unique(all(x)),x.end())
template<class T> inline void chmax(T &a, const T &b) { if(a < b) a = b; }
template<class T> inline void chmin(T &a, const T &b) { if(a > b) a = b; }

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int,int> pii;
typedef tuple<int,int,int> iii;
template<typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;

// dump macro
#ifdef PCM
  #include "dump.hpp"
#else
  #define dump(...) 42
  #define dump_1d(...) 42
  #define dump_2d(...) 42
#endif
struct Fast { Fast(){ std::cin.tie(0); ios::sync_with_stdio(false); } } fast;
// }}}

int solve(){
  int n,m;
  cin>>n>>m;

  vvi e(n, vi());
  rep(i, m){
    int p,q;
    cin>>p>>q;p--;q--;
    e[p].pb(q);
    e[q].pb(p);
  }

  int q;cin>>q;
  rep(i, q){
    int r[n]={};
    int d[n]={};
    rep(i, n) d[i]=-1;
    int st;cin>>st;st--;
    PQ<pii> s;
    s.push(mp(0LL, st));
    for (auto& el:e[st]){
      s.push(mp(1LL, el));
    }
    while(!s.empty()){
      pii node = s.top();s.pop();
      if (r[node.second]==1) continue;

      d[node.second] = node.first;
      r[node.second]=1;
      for (auto& el:e[node.second]){
        s.push(mp(node.first+1, el));
      }
    }
    dump_1d(d, n);
    int f=0;
    rep(i, n){
      if (d[i]>0) f++;
    }
    int res=0;
    res = max(0LL, *max_element(d, d+n));
    rep(j, 20){
      if (pow(2, j)>=res){
        res=j;
        break;
      }
    }
    cout << f << " " << res << endl;
  }

  return 0;
}

signed main() { //{{{
#ifdef INPUT_FROM_FILE
  std::ifstream in(infile);
  std::cin.rdbuf(in.rdbuf());
#endif
  solve();
  return 0;
} //}}}