#include <set>
#include <cstdio>
#define N 100010
using namespace std;
typedef long long ll;
set<int> s;
int head[N] , to[N << 1] , len[N << 1] , next[N << 1] , cnt , fa[N][20] , deep[N] , log[N] , pos[N] , ref[N] , tot , vis[N];
ll dis[N];
inline void add(int x , int y , int z)
{to[++cnt] = y , len[cnt] = z , next[cnt] = head[x] , head[x] = cnt;
}
void dfs(int x)
{int i;pos[x] = ++tot , ref[tot] = x;for(i = 1 ; (1 << i) <= deep[x] ; i ++ ) fa[x][i] = fa[fa[x][i - 1]][i - 1];for(i = head[x] ; i ; i = next[i])if(to[i] != fa[x][0])fa[to[i]][0] = x , deep[to[i]] = deep[x] + 1 , dis[to[i]] = dis[x] + len[i] , dfs(to[i]);
}
inline int lca(int x , int y)
{int i;if(deep[x] < deep[y]) swap(x , y);for(i = log[deep[x] - deep[y]] ; ~i ; i -- )if((1 << i) <= deep[x] - deep[y])x = fa[x][i];if(x == y) return x;for(i = log[deep[x]] ; ~i ; i -- )if((1 << i) <= deep[x] && fa[x][i] != fa[y][i])x = fa[x][i] , y = fa[y][i];return fa[x][0];
}
int main()
{int n , m , i , x , y , z;set<int>::iterator it;ll now = 0;scanf("%d%d" , &n , &m);for(i = 2 ; i <= n ; i ++ ) scanf("%d%d%d" , &x , &y , &z) , add(x , y , z) , add(y , x , z) , log[i] = log[i >> 1] + 1;dfs(1);while(m -- ){scanf("%d" , &x) , y = z = 0;if(!vis[x]){it = s.upper_bound(pos[x]);if(it != s.end()) y = ref[*it];if(it != s.begin()) z = ref[*--it];if(y) now -= dis[lca(x , y)];if(z) now -= dis[lca(x , z)];if(y && z) now += dis[lca(y , z)];now += dis[x] , vis[x] = 1 , s.insert(pos[x]);}else{now -= dis[x] , vis[x] = 0 , s.erase(pos[x]);it = s.upper_bound(pos[x]);if(it != s.end()) y = ref[*it];if(it != s.begin()) z = ref[*--it];if(y) now += dis[lca(x , y)];if(z) now += dis[lca(x , z)];if(y && z) now -= dis[lca(y , z)];}if(s.size() < 2) puts("0");else printf("%lld\n" , (now - dis[lca(ref[*s.begin()] , ref[*--s.end()])]) << 1);}return 0;
}