from ctypes import Union


class Unionfind:
     
    def __init__(self,n):
        self.uf = [-1]*n
 
    def find(self,x):
        if self.uf[x] < 0:
            return x
        else:
            self.uf[x] = self.find(self.uf[x])
            return self.uf[x]
 
    def same(self,x,y):
        return self.find(x) == self.find(y)
 
    def union(self,x,y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return False
        if self.uf[x] > self.uf[y]:
            x,y = y,x
        self.uf[x] += self.uf[y]
        self.uf[y] = x
        return True
 
    def size(self,x):
        x = self.find(x)
        return -self.uf[x]


n = int(input())
ans = 0
mod = 10**9+7

edges = [list(map(int,input().split())) for i in range(n-1)]
for i in range(30):
    uf = Unionfind(n)
    for a,b,c in edges:
        if c >> i & 1:
            uf.union(a-1,b-1)

    for ind in range(n):
        if uf.find(ind) != ind:
            continue
        s = uf.size(ind)
        ans += (s*(s-1)//2)<<i
        ans %= mod
print(ans)