package main

import (
	"bufio"
	"fmt"
	"math/bits"
	"os"
	"strconv"
)

func configure(scanner *bufio.Scanner) {
	scanner.Split(bufio.ScanWords)
	scanner.Buffer(make([]byte, 1000005), 1000005)
}
func getNextString(scanner *bufio.Scanner) string {
	scanned := scanner.Scan()
	if !scanned {
		panic("scan failed")
	}
	return scanner.Text()
}
func getNextInt(scanner *bufio.Scanner) int {
	i, _ := strconv.Atoi(getNextString(scanner))
	return i
}
func getNextInt64(scanner *bufio.Scanner) int64 {
	i, _ := strconv.ParseInt(getNextString(scanner), 10, 64)
	return i
}
func getNextFloat64(scanner *bufio.Scanner) float64 {
	i, _ := strconv.ParseFloat(getNextString(scanner), 64)
	return i
}
func main() {
	fp := os.Stdin
	wfp := os.Stdout
	extra := 0
	if os.Getenv("I") == "IronMan" {
		fp, _ = os.Open(os.Getenv("END_GAME"))
		extra = 100
	}
	scanner := bufio.NewScanner(fp)
	configure(scanner)
	writer := bufio.NewWriter(wfp)
	defer func() {
		r := recover()
		if r != nil {
			fmt.Fprintln(writer, r)
		}
		writer.Flush()
	}()
	solve(scanner, writer)
	for i := 0; i < extra; i++ {
		fmt.Fprintln(writer, "-----------------------------------")
		solve(scanner, writer)
	}
}
func solve(scanner *bufio.Scanner, writer *bufio.Writer) {
	n := getNextInt(scanner)
	m := getNextInt(scanner)
	g := newGraph(n)

	for i := 0; i < m; i++ {
		u := getNextInt(scanner) - 1
		v := getNextInt(scanner) - 1
		g.appendEdge(u, v, i)
		g.appendEdge(v, u, i)
	}
	q := getNextInt(scanner)
	for i := 0; i < q; i++ {
		a := getNextInt(scanner) - 1
		dd := make([]int, n)
		vv := make([]bool, n)
		pp := make([]pair, 0)
		pp = append(pp, pair{a, 0})
		vv[a] = true
		for len(pp) > 0 {
			p := pp[0]
			pp = pp[1:]
			dd[p[0]] = p[1]
			for _, e := range g.e[p[0]] {
				if vv[e.to] {
					continue
				}
				vv[e.to] = true
				pp = append(pp, pair{e.to, p[1] + 1})
			}
		}
		mx := 0
		cnt := 0
		for j := 0; j < n; j++ {
			if dd[j] == 0 {
				continue
			}
			cnt++
			if mx < dd[j] {
				mx = dd[j]
			}
		}
		if mx > 0 {
			mx--
		}
		days := 32 - bits.LeadingZeros32(uint32(mx))
		fmt.Fprintln(writer, fmt.Sprintf("%d %d", cnt, days))
	}
}

type pair [2]int
type vertex struct {
}
type edge struct {
	to, id int
}
type graph struct {
	v []vertex
	e [][]edge
}

func newGraph(n int) graph {
	return graph{
		v: make([]vertex, n),
		e: make([][]edge, n),
	}
}
func (g *graph) appendEdge(from, to, id int) {
	g.e[from] = append(g.e[from], edge{
		to: to,
		id: id,
	})
}