After running tests on samples of ore, mining engineers must plot out the economics of extraction, transportation, and treatment in long range terms. Feasibility reports are then drafted for executive decision.

In a given Ontario town, all the extracted ore is shipped using the town's transportation network, known as its Bulk Transportation Chain (BTC). The BTC is a network of (N) ore processing plants, numbered from (1) to (N), with (N-1) roads running amongst them. The (i)th road allows ore to be shipped in either direction between plants (A_i) and (B_i). It is possible to reach any plant from any other plant by following a sequence of roads.

Mining is a dirty business, and not just among blue-collar workers. Executives of a new mining project are plotting to sabotage their rival company's presence in a given town by disrupting its transportation operations. However, in trying to actually build the blockade on the aforementioned roads, their plan was foiled.

As it turns out, ore processing plants communicate with one another via radio towers. Plant (i) within the BTC network operates their radio towers on a frequency of (F_i) kilohertz, where (F_i) is an integer. On a given radio frequency, all of the plants will be able to communicate freely. Thus if ore transportation is disrupted between any pair of plants on the same frequency, they will notice immediately and alert their headquarters.

Equipped with this new intel, the executives would like to take another crack at disrupting their rival's operations. This time, they would like to blockade as many roads as they can, while ensuring that any pair of plants on the same radio frequency can still transport ore to each other through some sequence of roads. This way, every single plant will remain ignorant to any blockaded roads.

Given this restriction, what is the maximum number of roads that can be blockaded?

Constraints

(1 \le T \le 45) (2 \le N \le 800{,}000) (1 \le A_i, B_i \le N) (1 \le F_i \le N)

The sum of (N) across all towns is at most (4{,}000{,}000).

Input

Input begins with an integer (T), the number of towns that the execs are scoping out. For each town, there is first a line containing the single integer (N). Then, (N-1) lines will follow, the (i)th of which contains the (2) space-separated integers (A_i) and (B_i). Then, there is a line with (N) space-separated integers, (F_{1..N}).

Output

For the (i)th town, output a line containing "Case #i: " followed by a single integer, the maximum number of roads that can be blockaded without the rival company finding out.

Sample Explanation

In the first town, the BTC network looks as follows:

Since both plants are on the same frequency, blockading the road between them would lead to the rival company finding out.

The second town is similar to the first, except the plants are on different frequencies. Therefore, they would not be able to detect the blockade.

In the third town, the BTC network looks as follows:

The fourth town is similar to the third, except that neither road may be blocked without disconnecting equal-frequency plants (2) and (3).

In the fifth town, at most (2) roads may be blockaded (the roads between plants (2) and (5), and between plants (5) and (1)).