#include<cstdio>
#include<atcoder/dsu>
#include<atcoder/modint>
using namespace atcoder;
using Mint = modint1000000007;

int main(){
    int N;
    scanf("%d", &N);
    int A[N], B[N], C[N];
    for(int i = 0; i < N-1; ++i){
        scanf("%d %d %d", A + i, B + i, C + i);
        A[i]--,B[i]--;
    }
    Mint answer = Mint::raw(0);
    for (int bit = 0; bit < 30; bit++)
    {
        dsu uft(N);
        for (int i = 0; i < N-1; i++)
            if(C[i]>>bit&1) uft.merge(A[i], B[i]);
        auto result = uft.groups();
        Mint reachable_pair = Mint::raw(0);
        for(auto &i : result) reachable_pair += Mint::raw(i.size())*Mint::raw(i.size()-1);
        answer += bit ? reachable_pair*Mint::raw(1<<(bit-1)) : reachable_pair/Mint::raw(2);
    }
    printf("%u\n", answer.val());
    return 0;
}