[Solution] Water Container System Round F 2022 - Kick Start 2022 Solution 

Problem

There is a water container system with N$N$ identical containers, which can be represented as a tree, where each container is a vertex. The containers are connected to each other with N−1$\mathbf{N}-1$ bidirectional pipes. Two containers connected to each other are always placed on adjacent levels. Formally, if two containers a$a$ and b$b$ are connected to each other, then |levela−levelb|=1$|leve{l}_a-leve{l}_b|=1$. Container 1$1$ is placed at the bottommost level. Each container is connected to exactly one container on the level below (the only exception is container 1$1$, which has no connections below it), but can be connected to zero or more containers on the level above. The maximum capacity of each container is 1$1$ liter, and initially all the containers are empty. Assume that the pipe has a capacity of 0$0$ liters. In other words, they do not store any water, but only allow water to pass through them in any direction.

Consider the following diagram which is an example of a water container system:

The first level of the system consists of a single container, container 1$1$ (root). Container 1$1$ is connected to container 2$2$ and container 3$3$, which are present in the above level, level 2$2$. Container 2$2$ is also connected to container 4$4$, which is present at level 3$3$.

You are given Q$Q$ queries. Each query contains a single integer i$i$ which represents a container. For each query, add an additional 1$1$ liter of water in container i$i$.

The following diagram illustrates the flow of the water in the system in different conditions:

In step 1$1$, after adding 1$1$ liter of water in container 3$3$, the water flows downward because the water containers at the lower level are still empty.
In step 2$2$, after adding 1$1$ liter of water in container 3$3$, the water flows downward, but as the container 1$1$ is already filled completely, the water is distributed evenly between water containers 2$2$ and 3$3$.
In step 3$3$, after adding 1$1$ liter of water in container 3$3$, the water containers 2$2$ and 3$3$ are completely filled.
In step 4$4$, after adding 1$1$ liter of water in container 3$3$, the water is pushed up to water container 4$4$, which is then completely filled.

As illustrated in the example above, containers at the same level will have the same amount of water. Find the number of water containers that are completely filled after processing all the queries.

Input

The first line of the input gives the number of test cases, T$T$. T$T$ test cases follow.
The first line of each test case contains the two integers N$N$ and Q$Q$, where N$N$ is the number of containers and Q$Q$ is the number of queries.
The next N−1$\mathbf{N}-1$ lines contain two integers i$i$ and j$j$ (1≤i,j≤N$1\le i,j\le \mathbf{N}$, and i≠j$i\ne j$) meaning that the i$i$-th water container is connected to the j$j$-th water container.
Each of the next Q$Q$ lines contain a single integer i$i$ (1≤i≤N$1\le i\le \mathbf{N}$) that represents the container to which 1$1$ liter of water should be added.

Output

For each test case, output one line containing Case #x$x$: y$y$, where x$x$ is the test case number (starting from 1) and y$y$ is the number of water containers that are completely filled after processing all the queries.

Limits

Memory limit: 1 GB.
1≤T≤100$1\le \mathbf{T}\le 100$.
1≤Q≤N$1\le \mathbf{Q}\le \mathbf{N}$.
It is guaranteed that the given water container system is a tree.

Test Set 1

Time limit: 20 seconds.
1≤N≤65535$1\le \mathbf{N}\le 65535$.
The water container system is a perfect binary tree.

Test Set 2

Time limit: 60 seconds.
1≤N≤104$1\le \mathbf{N}\le {10}^4$.