8526번 - Races 다국어

Elections are coming and the mayor of Bytetown decided to organize an athletic competition to increase his odds. Unfortunately there is no athletic stadium in Bytetown, so all parts of the competition will have to be held in the streets. The mayor decided to limit the competition only to running events and asked you for help with planning the troutes.

There are n street junctions and n-1 streets in Bytetown. The streets can be used to travel between any pair of junctions. Every route must start at a junction, lead along several streets and finish at some other junction. The mayor would like to organize as many events simultaneously as possible, so the number of routes should be as large as possible. Due to safety reasons no two routes may have a common junction or street. Moreover not every junction can be used as a starting or ending point of a race.

The first line of the input contains a single integer n (1 ≤ n ≤ 1,000,000): the number of junctions in Bytetown. The junctions are numbered from 1 to n. The following n-1 lines contain descriptions of the streets; each of them consists of two integers a and b (1 ≤ a,b ≤ n, a ≠ b), separated by a single space: the numbers of junctions that are endpoints of the street.

The line number n+1 contains one integer m (0 ≤ m ≤ n): the number of junctions that can serve as a starting or ending point of a race. The last line of the input contains m distinct space-separated numbers: the numbers of those junctions, each in the range [1,n].

The first and only line of the output should contain one integer, the maximal possible number of running events that can be held in Bytetown simultaneously.