Chikkpur is a happy village . Sahoo is sarpanch of Chikkpur and is throwing a New Year Party.
Nimit bhardwaj who is sarpanch of Peggpur is also invited to party at Chikkpur .
As Nimit bhardwaj is good friend of Sahoo, Sahoo wants to decorate all the places of Chikkpur which which Nimit will visit.
Map of Chikkpur is made of roads and chownks .
There are n chownks and connected by n-1 roads , there is a path from each chownk to other chownk .
Nimit will visit m chownks of Chikkpur .
chownks are numbered 1 to n .
As Sahoo is bit lazy, so he asked Vishi and plan the trip.
Vishi may decide any chownk as starting point of trip and visit any chownk any number of times .
Also he has to decide the trip in such a way that it includes all the chownks that Nimit wanna visit
As he is miser guy . He want to minimize the cost by reducing the number of decorated chownks.
Now tell the minimum number of chownks to be decorated
INPUT
first line of input contains single integer t denoting number of test cases .
first line of every test case contains two integers n and m, number of chownks in chikkpur and number of chownks nimit wants to visit.
second line contains m space separated integers denoting the index number of chownks be visited.
next n - 1 lines contain two numbers denoting the edges .
OUTPUT
for every test case output just one integer , minimum number of chownks to be decorated.
CONSTRAINTS
1<=t<=10
1<=n<=105
1<=m<=n
