#include<iostream>
#include<vector>
#include<string>
#include<cmath>
#include<algorithm>
#include<functional>
#include<numeric>
#include<queue>
#include<stack>
#include<map>
#include<unordered_map>
#include<set>
#include<bitset>
#include<random>

#pragma region
using namespace std;
#define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++)
#define rep(i,n) FOR(i,0LL,n)
#define RFOR(i,r,n) for(ll i=(ll)(n-1);i>=r;i--)
#define rrep(i,n) RFOR(i,0LL,n)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define COUNT(a,y,x) upper_bound(all(a), y) - lower_bound(all(a), x)
#define UNIQUE(a) sort(all(a)); a.erase(unique(all(a)), a.end())
#define pb push_back
typedef long long int ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<string> vs;
typedef map<ll, ll> MAP;
const ll inf = 2222222222222222222LL;
const ll mod = 1000000007LL;

ll n = 0, m = 0, ans = 0, tmp = 0, ma = -inf, mi = inf;
string s;
bool ok;
ll dx[9] = { 0,1,-1,0,0,1,1,-1,-1 }, dy[9] = { 0,0,0,1,-1,1,-1,1,-1 };
#define endl '\n'
#pragma endregion
#define MAX 222222



struct Weighted_Graph {
  struct edge { ll node, cost; };
  vector<vector<edge>> e;

  Weighted_Graph(ll x = MAX) { e.resize(x + 1); }

  void add_edge(ll a, ll b, ll c) { e[a].pb(edge{ b,c }); }

  vll dijkstra(ll start) {
    priority_queue<pll, vector<pll>, greater<pll>> pq;
    ll u;
    pll p;
    vll dist(e.size(), inf);
    dist[start] = 0;
    pq.push(pll(0, start));

    while (!pq.empty()) {
      p = pq.top(); pq.pop();
      u = p.second;
      if (dist[u] < p.first) continue;
      for (edge e1 : e[u]) {
        if (dist[e1.node] > dist[u] + e1.cost) {
          dist[e1.node] = dist[u] + e1.cost;
          pq.push(pll(dist[e1.node], e1.node));
        }
      }
    }
    return dist;
  }

};



int main(void) {
  ios::sync_with_stdio(false); cin.tie(0);


  cin >> n >> m;
  Weighted_Graph wg(n);
  rep(i, m) {
    ll a, b;
    cin >> a >> b;
    wg.add_edge(a, b, 1);
    wg.add_edge(b, a, 1);
  }
  cin >> m;
  rep(i, m) {
    ll a;
    cin >> a;
    vll v = wg.dijkstra(a);
    ans = 0;
    ma = 0;
    FOR(i, 1, n + 1) {
      if (v[i] > inf / 2) continue;
      ma = max(ma, v[i]);
      ans++;
    }
    if (ma == 1) ma = 0;
    cout << ans - 1 << " " << (ma + 1) / 2 << endl;
  }


  

  return 0;
}