import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int N, M;
int[] U, V;
int Q;
int[] A;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      M = readInt();
      U = new int[M];
      V = new int[M];
      foreach (i; 0 .. M) {
        U[i] = readInt() - 1;
        V[i] = readInt() - 1;
      }
      Q = readInt();
      A = new int[Q];
      foreach (q; 0 .. Q) {
        A[q] = readInt() - 1;
      }
      
      auto graph = new int[][N];
      foreach (i; 0 .. M) {
        graph[U[i]] ~= V[i];
        graph[V[i]] ~= U[i];
      }
      foreach (q; 0 .. Q) {
        DList!int que;
        auto dist = new int[N];
        dist[] = -1;
        dist[A[q]] = 0;
        que.insertBack(A[q]);
        for (; !que.empty; ) {
          const u = que.front;
          que.removeFront;
          foreach (v; graph[u]) {
            if (dist[v] == -1) {
              dist[v] = dist[u] + 1;
              que.insertBack(v);
            }
          }
        }
        int cnt, mx;
        foreach (u; 0 .. N) {
          if (dist[u] != -1) {
            ++cnt;
            chmax(mx, dist[u]);
          }
        }
        int ans;
        for (ans = 0; (1 << ans) < mx; ++ans) {}
        writeln(cnt - 1, " ", ans);
      }
    }
  } catch (EOFException e) {
  }
}