// MADE BY QT666
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<cstring>
#include<set>
#define int long long
using namespace std;
typedef long long ll;
const int N=300050;
int head[N],to[N],nxt[N],w[N],cnt,n,m,bj[N];
int deep[N],size[N],top[N],dfn[N],id[N],son[N],fa[N],tt;
ll dis[N],ans;
set<ll> s;
set<ll>::iterator it,pre,nex;
void lnk(int x,int y,int z){
to[++cnt]=y,nxt[cnt]=head[x],w[cnt]=z,head[x]=cnt;
to[++cnt]=x,nxt[cnt]=head[y],w[cnt]=z,head[y]=cnt;
}
void dfs1(int x,int f){
size[x]=1;deep[x]=deep[f]+1;
for(int i=head[x];i;i=nxt[i]){
int y=to[i];if(y==f) continue;
dis[y]=dis[x]+w[i];dfs1(y,x);
size[y]+=size[x];fa[y]=x;
if(size[y]>size[son[x]]) son[x]=y;
}
}
void dfs2(int x,int f){
top[x]=f;dfn[x]=++tt;id[tt]=x;
if(son[x]) dfs2(son[x],f);
for(int i=head[x];i;i=nxt[i]){
int y=to[i];if(y==fa[x]||y==son[x]) continue;
dfs2(y,y);
}
}
int lca(int x,int y){
while(top[x]!=top[y]){
if(deep[top[x]]<deep[top[y]]) swap(x,y);
x=fa[top[x]];
}
if(deep[x]<deep[y]) swap(x,y);
return y;
}
ll calc(int x,int y){return dis[x]+dis[y]-2*dis[lca(x,y)];}
void add(int x){
s.insert(dfn[x]);it=s.find(dfn[x]);
if(it!=s.begin()){pre=it;pre--;}
else {pre=s.end();pre--;}
if((++it)!=s.end()){nex=it;it--;}
else {nex=s.begin();}
ans+=(calc(x,id[*pre])+calc(x,id[*nex])-calc(id[*pre],id[*nex]));
}
void del(int x){
it=s.find(dfn[x]);
if(it!=s.begin()){pre=it;pre--;}
else {pre=s.end();pre--;}
if((++it)!=s.end()){nex=it;it--;}
else {nex=s.begin();}
ans-=(calc(x,id[*pre])+calc(x,id[*nex])-calc(id[*pre],id[*nex]));
s.erase(dfn[x]);
}
main(){
scanf("%lld%lld",&n,&m);
for(int i=1;i<n;i++){
int x,y,z;scanf("%lld%lld%lld",&x,&y,&z);
lnk(x,y,z);
}
dfs1(1,0);dfs2(1,1);
for(int i=1;i<=m;i++){
int x;scanf("%d",&x);bj[x]^=1;
if(bj[x]) add(x);else del(x);
printf("%lld\n",ans);
}
return 0;
}