//g++ 1.cpp -std=c++14 -O2 -I .
#include <bits/stdc++.h>
using namespace std;

#include <atcoder/all>
using namespace atcoder;

using ll = long long;
using ld = long double;

using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vst = vector<string>;
using vvst = vector<vst>;

#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pq_big(T) priority_queue<T,vector<T>,less<T>>
#define pq_small(T) priority_queue<T,vector<T>,greater<T>>
#define all(a) a.begin(),a.end()
#define rep(i,start,end) for(ll i=start;i<(ll)(end);i++)
#define per(i,start,end) for(ll i=start;i>=(ll)(end);i--)
#define uniq(a) sort(all(a));a.erase(unique(all(a)),a.end())

constexpr ll mod = 1e9+7;

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int n;
  cin>>n;

  vector<tuple<int,int,ll>> edge(n-1);
  rep(i,0,n-1){
    int a,b;
    ll c;
    cin>>a>>b>>c;
    a--;b--;
    edge[i]={a,b,c};
  }

  ll ans=0;
  rep(bt,0,32){
    dsu d(n);
    rep(i,0,n-1){
      auto [a,b,c]=edge[i];
      if(c&(1<<bt)){
        d.merge(a,b);
      }
    }

    ll pow2=(1<<bt);
    auto gr=d.groups();

    for(auto v:gr){
      ll sz=v.size();
      sz=(sz*(sz-1))/2;
      sz%=mod;
      sz*=pow2;
      sz%=mod;
      ans+=sz;
      ans%=mod;
    }
  }

  cout<<ans<<endl;
}