#include <cstdio>
#include <cstring>
#include <algorithm>
#include <set>
using namespace std;
typedef long long LL;
const int maxn=100000+10;
struct Node{int to,next,data;
}a[maxn<<1];
int n,m,head[maxn],cnt;
int prt[maxn],deep[maxn],size[maxn],son[maxn];
LL dis[maxn];
int Dfn[maxn],Time,top[maxn],pos[maxn];
bool flag[maxn];
LL ans=0;
set<int>S;
void Init();
void Insert(int,int,int);
void DFS1(int,int,int);
void DFS2(int,int);
int LCA(int,int);
LL Dis(int,int);
void Solve_Insert(int);
void Solve_Delte(int);
int main(){// freopen("in.cpp","r",stdin);
        Init();return 0;
}
void Init(){scanf("%d%d",&n,&m);int x,y,z;for(int i=1;i<n;i++){scanf("%d%d%d",&x,&y,&z);Insert(x,y,z);Insert(y,x,z);}DFS1(1,0,1);DFS2(1,1);S.insert(0);S.insert(n+1);while(m--){scanf("%d",&x);flag[x]=!flag[x];if(flag[x])Solve_Insert(x);else Solve_Delte(x);}
}
void Solve_Insert(int x){int L,R,prt1,prt2;LL tmp=0;S.insert(Dfn[x]);L=*--S.find(Dfn[x]);R=*++S.find(Dfn[x]);if(L>=1)ans+=Dis(pos[L],x);if(R<=n)ans+=Dis(pos[R],x);if(L>=1 && R<=n)ans-=Dis(pos[L],pos[R]);L=*++S.find(0),R=*--S.find(n+1);if(L>=1 && R<=n)tmp=Dis(pos[L],pos[R]);printf("%lld\n",tmp+ans);
}
void Solve_Delte(int x){int L,R,prt1,prt2;LL tmp=0;L=*--S.find(Dfn[x]);R=*++S.find(Dfn[x]);if(L>=1)ans-=Dis(pos[L],x);if(R<=n)ans-=Dis(pos[R],x);if(L>=1 && R<=n)ans+=Dis(pos[L],pos[R]);S.erase(Dfn[x]);L=*++S.find(0),R=*--S.find(n+1);if(L>=1 && R<=n)tmp=Dis(pos[L],pos[R]);printf("%lld\n",tmp+ans);
}
void Insert(int x,int y,int z){a[++cnt].to=y;a[cnt].next=head[x];a[cnt].data=z;head[x]=cnt;
}
#define y a[i].to
void DFS1(int x,int prt,int deep){::deep[x]=deep;::prt[x]=prt;::size[x]=1;for(int i=head[x];i;i=a[i].next){if(y==prt)continue;dis[y]=dis[x]+a[i].data;DFS1(y,x,deep+1);size[x]+=size[y];if(size[y]>size[son[x]])son[x]=y;}
}
void DFS2(int x,int top){::Dfn[x]=++Time;::top[x]=top;::pos[Time]=x;if(son[x])DFS2(son[x],top);for(int i=head[x];i;i=a[i].next){if(y==prt[x] || y==son[x])continue;DFS2(y,y);}
}
#undef y
int LCA(int x,int y){while(top[x]!=top[y]){if(deep[top[x]]<deep[top[y]])swap(x,y);x=prt[top[x]];}if(deep[x]<deep[y])return x;return y;
}
LL Dis(int x,int y){return dis[x]+dis[y]-2*dis[LCA(x,y)];
}