Codeforces Round 903 (Div. 3)---F. Minimum Maximum Distance--深搜变种+最短路+图论+dp

#include <bits/stdc++.h>
#define pb push_back
#define YES cout<<"YES"<<'\n';
#define NO cout<<"NO"<<'\n';
using namespace std;
using ll = long long;
ll n,k,pos;
vector<ll>a[200005];
int vis[200005],dis[200005];//标记走过的点and距离
bool vis2[200005];//标记已经标记点
queue<ll>q;
void bfs(ll u)
{
	memset(dis,0,sizeof(dis));
	memset(vis,0,sizeof(vis));
	pos=u;
	vis[u]=1;
	dis[u]=0;
	q.push(u);
	while(q.size())
	{
		auto it=q.front();
		q.pop();
		for(auto ed:a[it])
		{
			if(vis[ed]) continue;//已经走过
			vis[ed]=1;//此次bfs已经走过该点，标记
			dis[ed]=dis[it]+1;//走一步
			q.push(ed);//入队，继续扩散
			if(dis[ed]>dis[pos]&&vis2[ed]) pos=ed;//该点与pos离初始pos更远,更新pos点
		}
	}
}
void solve()
{
	cin>>n>>k;
	ll x,y;
	for(ll i=1;i<=n;i++) 
	{
		vis2[i]=0;
		a[i].clear();
	}
	for(ll i=1;i<=k;i++)
	{
		cin>>x;
		vis2[x]=1;
		pos=x;
	}
	for(ll i=1;i<n;i++)
	{
		cin>>x>>y;
		a[x].push_back(y);
		a[y].push_back(x);
	}
	if(k==1) 
	{
		cout<<0<<'\n';
		return;
	}
	bfs(pos);
	bfs(pos);//从距离最初pos点最远的点回走一遍，看是否存在更远的
	
	cout<<(dis[pos]+1)/2<<'\n';//向前取整
}
int main()
{
	cin.tie(0);
	cout.tie(0);
	ios_base::sync_with_stdio( false );
	
	ll t;cin>>t;
	while(t-- ) 
	solve();
	return 0;
}