#include <bits/stdc++.h>
using namespace std;
#include <atcoder/modint>
using namespace atcoder;
//using mint = modint998244353;
using mint = modint1000000007;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {return (A % M + M) % M;}
ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}
template<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());}
template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)

#include <atcoder/dsu>

int main()
{
  ll N;
  cin >> N;
  vector<ll> A(N - 1), B(N - 1), C(N - 1);
  for (ll i = 0; i < N - 1; i++)
  {
    cin >> A.at(i) >> B.at(i) >> C.at(i);
    A.at(i)--, B.at(i)--;
  }

  mint ans = 0;
  for (ll k = 0; k < 35; k++)
  {
    dsu ds(N);
    for (ll i = 0; i < N - 1; i++)
    {
      if (C.at(i) & (1LL << k))
        ds.merge(A.at(i), B.at(i));
    }

    auto gs = ds.groups();
    for (auto g : gs)
    {
      ll sz = g.size();
      mint tmp = sz * (sz - 1) / 2;
      ans += tmp * (1LL << k);
    }
  }
  cout << ans.val() << endl;
}