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

n = int(input())
ans = 0
union = [UnionFind(n) for _ in range(32)]
mod = 10**9 + 7

for i in range(n-1):
	a, b, c = map(int,input().split())
	for j in range(32):
		if (c >> j) & 1 == 1:
			union[j].union(a-1, b-1)

for i in range(n):
	for j in range(32):
		t = -union[j].parents[i]
		if t > 0:
			ans = (ans + t * (t - 1) // 2 * (1 << j)) % mod

print(ans)