import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
md = 10**9+7
# md = 998244353

n = II()
to = [[] for _ in range(n)]
cc = {}
for _ in range(n-1):
    u, v, c = LI1()
    c += 1
    to[u].append(v)
    to[v].append(u)
    cc[u, v] = cc[v, u] = c

parent, depth, vis = [-1]*n, [0]*n, [0]*n
def dfs(root=0):
    uu, stack = [], [root]
    vis[root] = 1
    while stack:
        u = stack.pop()
        uu.append(u)
        for v in to[u]:
            if vis[v]: continue
            vis[v] = 1
            parent[v] = u
            stack.append(v)
    return uu

uu = dfs()

ans = 0
for i in range(30)[::-1]:
    cnt = [1]*n
    s = 0
    for u in uu[:0:-1]:
        p = parent[u]
        if cc[p, u] >> i & 1:
            s += cnt[p]*cnt[u]
            cnt[p] += cnt[u]
    ans += pow(2, i, md)*s%md
    ans %= md

print(ans)