# https://yukicoder.me/problems/no/2200


class UnionFind:
    """
    UnionFindの基本的な処理を実装したクラス
    """

    def __init__(self, size):
        self.root = [i for i in range(size)]
        self.size = [1] * size

    def get_root(self, v):
        if v == self.root[v]:
            return v
        else:
            old_root = self.root[v]
            new_root = self.get_root(old_root)
            self.root[v] = new_root
            return new_root

    def merge(self, u, v):
        root_u = self.get_root(u)
        root_v = self.get_root(v)
        if root_u == root_v:
            return False

        if self.size[root_u] >= self.size[root_v]:
            self.size[root_u] += self.size[root_v]
            self.root[root_v] = root_u
            self.root[v] = root_u
        else:
            self.size[root_v] += self.size[root_u]
            self.root[root_u] = root_v
            self.root[u] = root_v
        return True
    
def main():
    N, M = map(int, input().split())
    edges = []
    for _ in range(M):
        a, b, w = map(int, input().split())
        edges.append((a - 1, b - 1, w))

    edges.sort(key=lambda x : x[2])

    uf = UnionFind(N)
    answer = 0
    for a, b, w in edges:
        a_size = uf.size[uf.get_root(a)]
        b_size = uf.size[uf.get_root(b)]
        if uf.merge(a, b):
            answer += a_size * b_size * w

    print(answer)







if __name__ == "__main__":
    main()