bool M1;
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdlib>
#include<climits>
#include<iomanip>
#include<cassert>
#include<random>
#include<cstdio>
#include<vector>
#include<bitset>
#include<stack>
#include<queue>
#include<deque>
#include<cmath>
#include<ctime>
#include<map>
#include<set>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/hash_policy.hpp>
//#include<ext/pb_ds/priority_queue.hpp>
#define fi first
#define se second
#define ll long long
#define Vector Point
#define I128 __int128
#define LD long double
#define ull unsigned ll
#define pii pair<ll,int>
#define pb(x) push_back(x)
#define syt cerr<<"sytakioi\n"
#define F(i,a,b) for(int i=a,i##end=b;i<=i##end;++i)
#define UF(i,a,b) for(int i=a,i##end=b;i>=i##end;--i)
#define look_memory cerr<<abs(&M2-&M1)/1024.0/1024<<'\n'
#define rd_i(l,r) uniform_int_distribution<int>(l,r)(rd)
#define rd_r(l,r) uniform_real_distribution<double>(l,r)(rd)
#define look_time cerr<<(clock()-Time)*1.0/CLOCKS_PER_SEC<<'\n'
using namespace std;
//using namespace __gnu_cxx;
mt19937 rd(time(0));
const int N=1e5+5;
int n,k;
ll ans,sum,num;
vector<pii> e[N];
int fa[N],dis[N],dis1[N],siz[N],son[N],id[N],rk[N],top[N],cnt;
inline void dfs(int u,int fath){
	siz[u]=1;
	fa[u]=fath;
	for(pii x:e[u]) if(x.fi!=fath){
		dis[x.fi]=dis[u]+x.se;
		dfs(x.fi,u);
		siz[u]+=siz[x.fi];
		if(siz[x.fi]>siz[son[u]]) son[u]=x.fi;
	}
}
inline void dfs1(int u,int topf){
	id[u]=++cnt;
	rk[cnt]=u;
	top[u]=topf;
	if(son[u]) dfs1(son[u],topf);
	for(pii x:e[u]) if(x.fi!=fa[u]&&x.fi!=son[u]) dfs1(x.fi,x.fi);
}
struct SEG{
	struct tree{ll sum,tag,val;}tr[N<<2];
	#define ls k<<1
	#define rs k<<1|1
	inline void pushup(int k){tr[k].sum=tr[ls].sum+tr[rs].sum;}
	inline void build(int k,int *a,int l=1,int r=n){
		if(l==r) return void(tr[k].val=2*a[rk[l]]);
		int mid=(l+r)>>1;
		build(ls,a,l,mid);build(rs,a,mid+1,r);
		tr[k].val=tr[ls].val+tr[rs].val;
	}
	inline void push(int k,int val){tr[k].sum+=val*tr[k].val;tr[k].tag+=val;}
	inline void pushdown(int k){if(tr[k].tag) push(ls,tr[k].tag),push(rs,tr[k].tag),tr[k].tag=0;}
	inline void add(int k,int l,int r,int l1=1,int r1=n){
		if(l<=l1&&r1<=r) return push(k,1);
		pushdown(k);
		int mid=(l1+r1)>>1;
		if(l<=mid) add(ls,l,r,l1,mid);
		if(mid<r) add(rs,l,r,mid+1,r1);
		pushup(k);
	}
	inline ll query(int k,int l,int r,int l1=1,int r1=n){
		if(l<=l1&&r1<=r) return tr[k].sum;
		pushdown(k);
		int mid=(l1+r1)>>1;ll res=0;
		if(l<=mid) res+=query(ls,l,r,l1,mid);
		if(mid<r) res+=query(rs,l,r,mid+1,r1);
		return res;
	}
}T[2];
inline void add(int x){
	ans+=dis[x]*num+sum;
	sum+=dis[x];++num;
	int u=x;
	while(x){
		ans-=T[0].query(1,id[top[x]],id[x]);
		if(x!=1) ans+=T[1].query(1,top[x]==1?id[son[1]]:id[top[x]],id[x]);
		x=fa[top[x]];
	}
	x=u;
	while(x){
		T[0].add(1,id[top[x]],id[x]);
		T[1].add(1,id[top[x]],id[x]);
		x=fa[top[x]];
	}
}
bool M2;
int main(){
	int Time=clock();
	look_memory;
	cin.tie(nullptr)->sync_with_stdio(false);
	cin>>n>>k;
	F(i,1,n-1){
		int u,v,w;cin>>u>>v>>w;
		e[u].emplace_back(v,w);
		e[v].emplace_back(u,w);
	}
	dfs(1,0);dfs1(1,1);
	F(i,1,n) dis1[i]=dis[fa[i]];
	T[0].build(1,dis);T[1].build(1,dis1);
//	F(i,1,n) cout<<dis[i]<<' ';cout<<'\n';
	add(1);
	F(i,1,k){
		int x;cin>>x;add(x);
		cout<<2*ans<<'\n';
	}
	look_time;
	return 0;
}