import sys
input = sys.stdin.readline
from collections import *

class Unionfind:
    def __init__(self, n):
        self.par = [-1]*n
        self.rank = [1]*n
    
    def root(self, x):
        r = x
        
        while not self.par[r]<0:
            r = self.par[r]
        
        t = x
        
        while t!=r:
            tmp = t
            t = self.par[t]
            self.par[tmp] = r
        
        return r
    
    def unite(self, x, y):
        rx = self.root(x)
        ry = self.root(y)
        
        if rx==ry:
            return
        
        if self.rank[rx]<=self.rank[ry]:
            self.par[ry] += self.par[rx]
            self.par[rx] = ry
            
            if self.rank[rx]==self.rank[ry]:
                self.rank[ry] += 1
        else:
            self.par[rx] += self.par[ry]
            self.par[ry] = rx
    
    def is_same(self, x, y):
        return self.root(x)==self.root(y)
    
    def count(self, x):
        return -self.par[self.root(x)]

N = int(input())
ABC = [tuple(map(int, input().split())) for _ in range(N-1)]
ans = 0
MOD = 10**9+7

for i in range(35):
    uf = Unionfind(N)
    
    for A, B, C in ABC:
        if (C>>i)&1:
            uf.unite(A-1, B-1)
        
    d = defaultdict(int)
    
    for v in range(N):
        d[uf.root(v)] += 1
    
    for v in d.values():
        ans += (1<<i)*v*(v-1)//2
        ans %= MOD

print(ans)