**Vlad and Unfinished Business solution codeforces** – Vlad and Nastya live in a city consisting of 𝑛n houses and 𝑛−1n−1 road. From each house, you can get to the other by moving only along the roads. That is, the city is a tree.

## [Solution] Vlad and Unfinished Business solution codeforces

Vlad lives in a house with index 𝑥x, and Nastya lives in a house with index 𝑦y. Vlad decided to visit Nastya. However, he remembered that he had postponed for later 𝑘k things that he has to do before coming to Nastya. To do the 𝑖i-th thing, he needs to come to the 𝑎𝑖ai-th house, things can be done in any order. In 11 minute, he can walk from one house to another if they are connected by a road.

Vlad does not really like walking, so he is interested what is the minimum number of minutes he has to spend on the road to do all things and then come to Nastya. Houses 𝑎1,𝑎2,…,𝑎𝑛a1,a2,…,an he can visit in any order. He can visit any house multiple times (if he wants).

The first line of input contains an integer 𝑡t (1≤𝑡≤1041≤t≤104) — the number of input test cases. There is an empty line before each test case.

The first line of each test case contains two integers 𝑛n and 𝑘k (1≤𝑘≤𝑛≤2⋅1051≤k≤n≤2⋅105) — the number of houses and things, respectively.

The second line of each test case contains two integers 𝑥x and 𝑦y (1≤𝑥,𝑦≤𝑛1≤x,y≤n) — indices of the houses where Vlad and Nastya live, respectively.

The third line of each test case contains 𝑘k integers 𝑎1,𝑎2,…,𝑎𝑘a1,a2,…,ak (1≤𝑎𝑖≤𝑛1≤ai≤n) — indices of houses Vlad need to come to do things.

The following 𝑛−1n−1 lines contain description of city, each line contains two integers 𝑣𝑗vj and 𝑢𝑗uj (1≤𝑢𝑗,𝑣𝑗≤𝑛1≤uj,vj≤n) — indices of houses connected by road 𝑗j.

It is guaranteed that the sum of 𝑛n for all cases does not exceed 2⋅1052⋅105.

## [Solution] Vlad and Unfinished Business solution codeforces

Output 𝑡t lines, each of which contains the answer to the corresponding test case of input. As an answer output single integer — the minimum number of minutes Vlad needs on the road to do all the things and come to Nastya.

3 3 1 1 3 2 1 3 1 2 6 4 3 5 1 6 2 1 1 3 3 4 3 5 5 6 5 2 6 2 3 2 5 3 1 3 3 4 3 5 5 6 5 2

3 7 2

## [Solution] Vlad and Unfinished Business solution codeforces

Tree and best path for the first test case: