mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.readline

    class UnionFind():
        def __init__(self, n):
            self.n = n
            self.root = [-1] * (n + 1)
            self.rnk = [0] * (n + 1)

        def find_root(self, x):
            while self.root[x] >= 0:
                x = self.root[x]
            return x

        def unite(self, x, y):
            x = self.find_root(x)
            y = self.find_root(y)
            if x == y:
                return
            elif self.rnk[x] > self.rnk[y]:
                self.root[x] += self.root[y]
                self.root[y] = x
            else:
                self.root[y] += self.root[x]
                self.root[x] = y
                if self.rnk[x] == self.rnk[y]:
                    self.rnk[y] += 1

        def isSameGroup(self, x, y):
            return self.find_root(x) == self.find_root(y)

        def size(self, x):
            return -self.root[self.find_root(x)]

    N = int(input())
    ABC = []
    for _ in range(N - 1):
        ABC.append(tuple(map(int, input().split())))

    ans = 0
    for lv in range(31):
        UF = UnionFind(N)
        for a, b, c in ABC:
            if c >> lv & 1:
                UF.unite(a, b)
        for v in range(1, N+1):
            if UF.find_root(v) == v:
                x = UF.size(v)
                ans += pow(2, lv, mod) * x * (x - 1) // 2
                ans %= mod
    print(ans)


if __name__ == '__main__':
    main()