import sys input = sys.stdin.readline N,K=map(int,input().split()) EDGE=[tuple(map(int,input().split())) for i in range(N-1)] from collections import defaultdict EC=[defaultdict(list) for i in range(N+1)] #EL=[[] for i in range(N+1)] for ind,(x,y,c) in enumerate(EDGE): EC[x][c].append(ind) EC[y][c].append(ind) #EL[x].append((y,c,ind)) #EL[y].append((x,c,ind)) Group = [i for i in range(N+1)] # グループ分け Nodes = [1]*(N+1) # 各グループのノードの数 def find(x): while Group[x] != x: x=Group[x] return x def Union(x,y): if find(x) != find(y): if Nodes[find(x)] < Nodes[find(y)]: Nodes[find(y)] += Nodes[find(x)] Nodes[find(x)] = 0 Group[find(x)] = find(y) else: Nodes[find(x)] += Nodes[find(y)] Nodes[find(y)] = 0 Group[find(y)] = find(x) for i in range(N+1): for c in EC[i]: if len(EC[i][c])>=2: for j in range(1,len(EC[i][c])): Union(EC[i][c][j-1],EC[i][c][j]) ANS=0 for i in range(N+1): if len(EC[i])>=2: L=[] for j in EC[i]: L.append(Nodes[find(EC[i][j][0])]) #print(i,L) S=0 for l in L: ANS+=l*S S+=l print(ANS)