#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

#define NOT 0
#define VIS 1
#define COMP 2
ll stt[MAX], d[MAX];
vector<pll> edge[MAX];
priority_queue<pll, vector<pll>, greater<pll>> pq;

void dijkstra(ll start) {
  pll mi;
  ll k;
  FOR(i, 1, n + 1) {
    stt[i] = NOT;
    d[i] = inf;
  }
  d[start] = 0;
  pq.push(pll(0, start));

  while (!pq.empty()) {
    mi = pq.top(); pq.pop();
    m = mi.second;
    stt[m] = COMP;
    if (d[m] < mi.first) continue;

    FOR(i, 0, edge[m].size()) {
      k = edge[m][i].first;
      if (stt[k] != COMP) {
        if (edge[m][i].second + d[m] < d[k]) {
          d[k] = edge[m][i].second + d[m];
          stt[k] = VIS;
          pq.push(pll(d[k], k));
        }
      }
    }
  }

}


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


  ll q;
  cin >> n >> q;
  rep(i, q) {
    ll a, b;
    cin >> a >> b;
    edge[a].pb(pll(b, 1));
    edge[b].pb(pll(a, 1));
  }
  cin >> q;
  rep(i, q) {
    ll a;
    cin >> a;
    dijkstra(a);
    ans = 0;
    ma = 0;
    FOR(j, 1, n + 1) {
      if (j == a) continue;
      if (d[j] > inf / 2) continue;
      ma = max(ma, d[j]);
      ans++;
    }
    if (ma == 1) ma = 0;
    cout << ans << " " << (ma + 1) / 2 << endl;
  }


  

  return 0;
}