import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(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-(-1 << 31)
inf = -1-(-1 << 63)
md = 10**9+7
# md = 998244353

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

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

parent, depth = [-1]*n, [0]*n
cc = [0]*n
uu = dfs()

ans = 0
for k in range(30):
    dp = [1]*n
    cur = 0
    for u in uu[:0:-1]:
        if cc[u] >> k & 1:
            dp[parent[u]] += dp[u]
        else:
            cur += dp[u]*(dp[u]-1)//2
    cur += dp[0]*(dp[0]-1)//2
    ans += cur*pow(2, k, md)%md
    ans %= md

print(ans)