class UnionFind:
  def __init__(self, n):
    self.node = [-1 for _ in range(n)]

  def root(self, v):
    if self.node[v] < 0:
      return v

    st = []
    while self.node[v] >= 0:
      st.append(v)
      v = self.node[v]

    for u in st:
      self.node[u] = v

    return v

  def size(self, v):
    v = self.root(v)
    return (- self.node[v])

  def same(self, u, v):
    return self.root(u) == self.root(v)

  def unite(self, u, v):
    ru = self.root(u)
    rv = self.root(v)
    if ru == rv:
      return

    du = self.node[ru]
    dv = self.node[rv]
    if du <= dv:
      self.node[rv] = ru
      self.node[ru] += dv
    else:
      self.node[ru] = rv
      self.node[rv] += du

MOD = 10 ** 9 + 7

n = int(input())
edges = []
for _ in range(n - 1):
  a, b, c = map(int, input().split())
  edges.append((a - 1, b - 1, c))

ans = 0
for i in range(30):
  uf = UnionFind(n)
  for a, b, c in edges:
    if (c >> i) & 1 != 0:
      uf.unite(a, b)

  cnt = 0
  for v in range(n):
    r = uf.root(v)
    if v == r:
      cnt += uf.size(r) * (uf.size(r) - 1) // 2

  ans = (ans + cnt * (1 << i)) % MOD

print(ans)