import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
    while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')




proc solve()=
  var
    n = scan()
    m = scan()
    es = newseqwith(n,newseq[int]())
    que = 0
    q = newseq[int]()
  for i in 0..<m:
    var
      a = scan()-1
      b = scan()-1
    es[a].add(b)
    es[b].add(a)
  que = scan()
  for i in 0..<que:
    q.add(scan()-1)

  # return (size,depth)
  proc bfs(s:int):(int,int)=
    var
      # (depth,point)のタプル
      q = initDeque[(int,int)]()
      dpt = newseqwith(n,int.high.div(4))
      fp = newseqwith(n,false)

    q.addLast((1,s))
    dpt[s]=1
    while q.len>0:
      var (d,p) = q.popFirst()
      fp[p]=true
      for nxt in es[p]:
        if dpt[nxt]>dpt[p]+1:
          dpt[nxt]=dpt[p]+1
          q.addLast((dpt[nxt],nxt))
    var
      depth = 0
      size=0
    #echo fp
    #echo dpt
    for p in 0..<n:
      if fp[p]:
        size+=1
        depth.max=(dpt[p])
    if depth == 2:
      depth=0
    return (size-1,depth)


  for v in q:
    var
      (s,d)=bfs(v)
    echo fmt"{s} {d.div(2)}"




      
     
solve()