#include <vector>

#include <cstdio>

#include <cstring>

#include <iostream>

#include <algorithm>

namespace remoon {

    #define ri register int

    #define ll long long

    #define tpr template <typename ra>

    #define rep(iu, st, ed) for(ri iu = st; iu <= ed; iu ++)

    #define drep(iu, ed, st) for(ri iu = ed; iu >= st; iu --)

    #define gc getchar

    inline int read() {

        int p = , w = ; char c = gc();

        while(c > '' || c < '') { if(c == '-') w = -; c = gc(); }

        while(c >= '' && c <= '') p = p *  + c - '', c = gc();

        return p * w;

    }

    int wr[], rw;

    #define pc(iw) putchar(iw)

    tpr inline void write(ra o, char c = '\n') {

        if(!o) pc('');

        if(o < ) o = -o, pc('-');

        while(o) wr[++ rw] = o % , o /= ;

        while(rw) pc(wr[rw --] + '');

        pc(c);

    }

}

using namespace std;

using namespace remoon;

#define sid 200050

#define pid 5000500

ll ans;

ll sum[sid];

int n, id, cnp;

int x[sid], y[sid], p[sid];

int cap[sid], nxt[sid], node[sid], val[sid], s[sid];

int fa[sid], rt[sid], ls[pid], rs[pid], sz[pid];

inline void addedge(int u, int v, int w) {

    nxt[++ cnp] = cap[u]; cap[u] = cnp;

    node[cnp] = v; val[cnp] = w;

    nxt[++ cnp] = cap[v]; cap[v] = cnp;

    node[cnp] = u; val[cnp] = w;

}

inline int find(int o) {

    if(fa[o] == o) return o;

    return fa[o] = find(fa[o]);

}

inline void insert(int &now, int l, int r, int v) {

    now = ++ id; sz[now] = ;

    if(l == r) return;

    int mid = (l + r) >> ;

    if(v <= mid) insert(ls[now], l, mid, v);

    else insert(rs[now], mid + , r, v);

}

inline int merge(int x, int y, int l = , int r =  << ) {

    if(!x || !y) return x + y;

    if(l == r) ans += 1ll * sz[x] * sz[y];

    int mid = (l + r) >> ;

    ls[x] = merge(ls[x], ls[y], l, mid);

    rs[x] = merge(rs[x], rs[y], mid + , r);

    sz[x] += sz[y];

    return x;

}

#define cur node[i]

inline void dfs(int o, int f) {

    insert(rt[o], ,  << , s[o]);

    for(int i = cap[o]; i; i = nxt[i])

    if(cur != f) s[cur] = s[o] ^ val[i], dfs(cur, o);

}

int main() {

    n = read();

    rep(i, , n - ) {

        x[i] = read(); y[i] = read();

        int w = read(); addedge(x[i], y[i], w);

    }

    rep(i, , n) fa[i] = i;

    rep(i, , n - ) p[i] = read();

    dfs(, );

    drep(i, n - , ) {

        int u = find(x[p[i]]), v = find(y[p[i]]);

        fa[v] = u; merge(rt[u], rt[v]);

        sum[i] = ans;

    }

    rep(i, , n) write(sum[i]);

    return ;

}