import java.io.*;
import java.util.*;

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        int m = sc.nextInt();
        ArrayList<ArrayList<Integer>> graph = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            graph.add(new ArrayList<>());
        }
        for (int i = 0; i < m; i++) {
            int a = sc.nextInt() - 1;
            int b = sc.nextInt() - 1;
            graph.get(a).add(b);
            graph.get(b).add(a);
        }
        int q = sc.nextInt();
        int[] costs = new int[n];
        PriorityQueue<Path> queue = new PriorityQueue<>();
        TreeMap<Integer, Integer> days = new TreeMap<>();
        int value = 1;
        for (int i = 0; i < 30; i++) {
            days.put(value, i);
            value *= 2;
        }
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < q; i++) {
            int x = sc.nextInt() - 1;
            Arrays.fill(costs, Integer.MAX_VALUE);
            queue.add(new Path(x, 0));
            int max = 0;
            int count = 0;
            while (queue.size() > 0) {
                Path p = queue.poll();
                if (costs[p.idx] < p.value) {
                    continue;
                }
                costs[p.idx] = p.value;
                max = p.value;
                count++;
                for (int y : graph.get(p.idx)) {
                    queue.add(new Path(y, p.value + 1));
                }
            }
            sb.append(count - 1).append(" ").append(days.ceilingEntry(max).getValue()).append("\n");
        }
        System.out.print(sb);
    }
    
    static class Path implements Comparable<Path> {
        int idx;
        int value;
        
        public Path(int idx, int value) {
            this.idx = idx;
            this.value = value;
        }
        
        public int compareTo(Path another) {
            return value - another.value;
        }
    }
}
class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public double nextDouble() throws Exception {
        return Double.parseDouble(next());
    }
    
    public String next() throws Exception {
        if (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
}