#include <bits/stdc++.h>
using namespace std;

constexpr int mod = 1000000007;

struct UnionFind {
    vector<int> par;
    vector<int> size;
    UnionFind(int n) {
        par.resize(n);
        size.resize(n,1);
        for(int i = 0; i < n; i++) {
            par[i] = i;
        }
    }
    int find(int x) {
        if(par[x] == x) {
            return x;
        }
        return par[x] = find(par[x]);
    }
    bool same(int x, int y) {
        return find(x) == find(y);
    }
    int consize(int x) {
        return size[find(x)];
    }
    bool unite(int x, int y) {
        x = find(x);
        y = find(y);
        if(x == y) {
            return false;
        }
        if(size[x] > size[y]) {
            swap(x,y);
        }
        par[x] = y;
        size[y] += size[x];
        return true;
    }
};

int main() {
    int N;
    cin >> N;
    vector<int>A(N-1),B(N-1),C(N-1);
    for(int i = 0; i < N-1; i++) {
        cin >> A[i] >> B[i] >> C[i];
        A[i]--;
        B[i]--;
    }
    long long ans = 0;
    for(int i = 0; i < 30; i++) {
        UnionFind uf(N);
        for(int j = 0; j < N-1; j++) {
            if(1 & (C[j] >> i)) {
                uf.unite(A[j],B[j]);
            }
        }
        for(int j = 0; j < N; j++) {
            if(uf.find(j) == j) {
                long long c = uf.consize(j);
                c = c*(c-1)/2;
                c %= mod;
                ans += (1ll << i)*c%mod;
                ans %= mod;
            }
        }
    }
    cout << ans << endl;
}