#pragma GCC ta g("avx2") #pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> using namespace std; #define DEBUG #ifdef DEBUG template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { os << '(' << p.first << ',' << p.second << ')'; return os; } template <class T> ostream &operator<<(ostream &os, const vector<T> &v) { os << '{'; for(int i = 0; i < (int)v.size(); i++) { if(i) { os << ','; } os << v[i]; } os << '}'; return os; } void debugg() { cerr << endl; } template <class T, class... Args> void debugg(const T &x, const Args &... args) { cerr << " " << x; debugg(args...); } #define debug(...) \ cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__) #define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl #else #define debug(...) (void(0)) #define dump(x) (void(0)) #endif using namespace std; typedef long long ll; typedef vector<ll> vl; typedef vector<vl> vvl; typedef vector<char> vc; typedef vector<string> vs; typedef vector<bool> vb; typedef vector<double> vd; typedef pair<ll,ll> P; typedef pair<int,int> pii; typedef vector<P> vpl; typedef tuple<ll,ll,ll> tapu; #define rep(i,n) for(int i=0; i<(n); i++) #define REP(i,a,b) for(int i=(a); i<(b); i++) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){ if(a>b){ a = b; return true; } else return false; } template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){ if(a<b){ a = b; return true; } else return false; } template<typename T> inline void print(T &a){ int sz = a.size(); for(auto itr = a.begin(); itr != a.end(); itr++){ cout << *itr; sz--; if(sz) cout << " "; } cout << "\n"; } template<typename T1,typename T2> inline void print2(T1 a, T2 b){ cout << a << " " << b << "\n"; } template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){ cout << a << " " << b << " " << c << "\n"; } void mark() {cout << "#" << "\n";} ll pcount(ll x) {return __builtin_popcountll(x);} //#include <atcoder/mincostflow> //using namespace atcoder; const int inf = (1<<30)-1; const ll linf = 1LL<<61; const int MAX = 5100000; int dy[8] = {0,1,0,-1,1,-1,-1,1}; int dx[8] = {-1,0,1,0,1,-1,1,-1}; const double pi = acos(-1); const double eps = 1e-9; const int mod = 1e9 + 7; //const int mod = 998244353; struct UnionFind{ vl p; vl rank; vl cnt; UnionFind(ll n){ rank.resize(n,0); p.resize(n,0); cnt.resize(n,0); rep(i,n){ p[i] = i; rank[i] = 0; cnt[i] = 1; } } ll find(ll x){ if(x != p[x]) p[x] = find(p[x]); return p[x]; } bool same(ll x, ll y){ return find(x) == find(y); } void unite(ll x, ll y){ x = find(x); y = find(y); if(x == y) return; if(rank[x] > rank[y]){ p[y] = x; cnt[x] += cnt[y]; }else{ p[x] = y; cnt[y] += cnt[x]; if(rank[x] == rank[y]) rank[y]++; } } ll size(ll x){ return cnt[find(x)]; } }; int main(){ int n; cin >> n; vector<vpl> G(n); rep(i,n-1){ ll a,b,c; cin >> a >> b >> c; a--; b--; G[a].emplace_back(b,c); G[b].emplace_back(a,c); } ll ans = 0; rep(i,31){ UnionFind uf(n); rep(j,n) for(auto v : G[j]){ if(v.second>>i & 1) uf.unite(j,v.first); } vl cnt(n,0); rep(j,n) cnt[uf.find(j)]++; rep(j,n) ans += (cnt[j] * (cnt[j]-1) / 2) % mod * (1<<i) % mod; ans %= mod; } cout << ans << endl; }