rt。

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=3e5+5;
const int K=20;
int n,q,tot,head[N],siz[N],dep[N],fa[N][K],uf[N],e[N];
ll dis[N],ans[N],resnow;
bool del[N];
struct Node
{
	int nxt,to;
	ll w;
}edge[N<<2];
struct Edge
{
	int u,v;
	ll w;
}b[N];
void AddEdge(int u,int v,ll w)
{
	edge[++tot]={head[u],v,w};
	head[u]=tot;
}
void dfs(int u,int fu,int f)
{
	uf[u]=f;
	fa[u][0]=fu;
	dep[u]=dep[fu]+1;
	for (int i(1);i<K;i++) fa[u][i]=fa[fa[u][i-1]][i-1];
	for (int i=head[u];i;i=edge[i].nxt)
	{
		int v=edge[i].to;
		ll w=edge[i].w;
		if (v==fu) continue;
		dis[v]=dis[u]+w;
		dfs(v,u,f);
	}
}
int lowbit(int x){return x&(-x);}
int lca(int u,int v)
{
	if (dep[u]>dep[v]) swap(u,v);
	int d=dep[v]-dep[u];
	for (int i=d;i;i-=lowbit(i)) v=fa[v][int(log2(lowbit(i)))];
	if (u==v) return u;
	for (int i=K-1;i>=0;i--)
		if (fa[u][i]!=fa[v][i]) u=fa[u][i],v=fa[v][i];
	return fa[u][0];
}
inline ll distance(int u,int v){return dis[u]+dis[v]-2*dis[lca(u,v)];}
struct LPT{int u,v;}ut[N];
LPT GetNew(int u1,int v1,int u2,int v2)
{
	ll mx=-1,d1=distance(u1,u2),d2=distance(u1,v1),d3=distance(u1,v2),d4=distance(u2,v1),d5=distance(u2,v2),d6=distance(v1,v2);
	int ansu,ansv;
	if (d1>mx) mx=d1,ansu=u1,ansv=u2;
	if (d2>mx) mx=d2,ansu=u1,ansv=v1;
	if (d3>mx) mx=d3,ansu=u1,ansv=v2;
	if (d4>mx) mx=d4,ansu=u2,ansv=v1;
	if (d5>mx) mx=d5,ansu=u2,ansv=v2;
	if (d6>mx) mx=d6,ansu=v1,ansv=v2;
	return {ansu,ansv};
}
void merge(int u,int v,ll w)
{
	if (siz[uf[u]]<siz[uf[v]]) swap(u,v);
	LPT x=ut[uf[u]],y=ut[uf[v]];
	if (uf[u]!=uf[v]) siz[uf[u]]+=siz[uf[v]];
	AddEdge(u,v,w);AddEdge(v,u,w);
	dis[v]=dis[u]+w;
	dfs(v,u,uf[u]);
	ut[uf[u]]=GetNew(x.u,x.v,y.u,y.v);
	resnow=max(resnow,distance(ut[uf[u]].u,ut[uf[u]].v));
}
int main()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int T;
	cin>>T; 
	while (T--)
	{
		cin>>n>>q;
		for (int i(1);i<n;i++) cin>>b[i].u>>b[i].v>>b[i].w;
		memset(del,0,sizeof(del));
		tot=0,resnow=0;
		memset(head,0,sizeof(head));
		memset(dep,0,sizeof(dep));
		memset(fa,0,sizeof(fa));
		memset(dis,0,sizeof(dis));
		memset(ans,0,sizeof(ans));
		for (int i(1);i<=q;i++)
		{
			cin>>e[i];
			del[e[i]]=1;
		}
		for (int i(1);i<=n;i++) ut[i]={i,i},siz[i]=1,uf[i]=i;
		for (int i(1);i<n;i++)
			if (!del[i]) merge(b[i].u,b[i].v,b[i].w);
		for (int i=q;i>=1;i--)
		{
			ans[i]=resnow;
			merge(b[e[i]].u,b[e[i]].v,b[e[i]].w);
			del[e[i]]=0;
		}
		for (int i(1);i<=q;i++) cout<<ans[i]<<"\n";
	}
	return 0;
}