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

#ifdef _RUTHEN
#include "debug.hpp"
#else
#define show(...) true
#endif

using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(x) begin(x), end(x)
template <class T> using V = vector<T>;

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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int N;
    cin >> N;
    V<int> u(N - 1), v(N - 1), c(N - 1);
    rep(i, N - 1) {
        cin >> u[i] >> v[i] >> c[i];
        u[i]--, v[i]--;
    }
    mint p2 = 1, ans = 0;
    rep(i, 32) {
        dsu uf(N);
        rep(j, N - 1) {
            if (c[j] >> i & 1) {
                uf.merge(u[j], v[j]);
            }
        }
        rep(j, N) {
            if (uf.leader(j) == j) {
                ans += p2 * uf.size(j) * (uf.size(j) - 1) / 2;
            }
        }
        p2 *= 2;
    }
    cout << ans.val() << '\n';
    return 0;
}