from collections import defaultdict

class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):#self.parentsに要素数を記録しているのでほぼO(1)でできる
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):#o(N)かかって非常に遅いです
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        group_members = defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members

    def __str__(self):
        return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())

N = int(input())
ans = 0
store = []
mod = 10 ** 9 + 7
for _ in range(N-1):
    a,b,c = map(int,input().split())
    a-=1
    b-=1
    store.append((a,b,c))
for k in range(30):
    uf = UnionFind(N)
    cnt = [0 for _ in range(N)]
    s = 0
    for a,b,c in store:
        if (c>>k) & 1:
            uf.union(a,b)
    for i in range(N):
        cnt[uf.find(i)] += 1
    for i in range(N):
        if cnt[i] > 1:
            s += (cnt[i] * (cnt[i]-1)) //2
            s %= mod
    ans += pow(2,k,mod) * s
    ans %= mod
print(ans)