#include <cassert>
#include <iostream>
#include <vector>
#include <map>
using namespace std;

long long ans = 0;

pair<long long,long long> dfs(const vector<vector<pair<int,int>>> &G, int v, int p, int c){
  map<long long,long long> C;
  vector<long long> Q;
  long long s = 1, d = 0, f = 0;
  for(auto e : G[v]){
    if(e.first == p){
      Q.push_back(-10);
      continue;
    }
    auto q = dfs(G,e.first,v,e.second);
    Q.push_back(q.first);
    C[e.second] += q.first;
    f += q.first;
    if(e.second == c) s += q.first, d += q.second;
    else d += q.first;
    ans += q.second;
    // diff += q.second;
  }
  long long diff = 0;
  for(size_t i = 0; i < G[v].size(); ++i){
    if(G[v][i].first == p) continue;
    // ans += Q[i].first*(f-C[G[v][i].second]);
    diff += Q[i]*(f-C[G[v][i].second]);
  }
  assert(diff%2 == 0);
  ans += diff/2;
  return {s,d};
}

int main(){
  int N, K;
  cin >> N >> K;
  vector<vector<pair<int,int>>> G(N);
  for(int i = 1; i < N; ++i){
    int u, v, c;
    cin >> u >> v >> c;
    --u,--v,--c;
    G[u].emplace_back(v,c);
    G[v].emplace_back(u,c);
  }
  dfs(G,0,-1,-1);
  cout << ans << endl;
}