#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;


vector<pair<int,int>> v[101010];
int sz[101010];
bool used[101010];

void szdfs(int x,int p){
    sz[x]=1;
    for(auto [to,color] : v[x]){
        if(to==p||used[to])continue;
        szdfs(to,x);
        sz[x]+=sz[to];
    }
}

int centroid(int x,int p,int total){
    for(auto [to,color] : v[x]){
        if(to==p||used[to])continue;
        if(2*sz[to]>total)return centroid(to,x,total);
    }
    return x;
}
map<pair<int,int>, int> MP, mp;
map<int,int> ONE, one, TWO, two;
int ONES, ones;

ll ans;

void dfs(int x,int p, int fi, int se){
    if(fi && se){
        ans += MP[minmax(fi,se)]++-mp[minmax(fi,se)]++;

        ans += ONE[fi]++-one[fi]++;

        ans += ONE[se]++-one[se]++;

        ++TWO[fi];++TWO[se];
        ++two[fi];++two[se];
    }
    else if(fi){
        ans += TWO[fi]++-two[fi]++;

        ans += ONES++-ONE[fi]++;
        ans -= ones++-one[fi]++;
    }
    for(auto [to,color] : v[x]){
        if(to==p||used[to])continue;
        if(!se){
            if(color==fi)dfs(to, x, fi, se);
            else dfs(to,x,fi,color);
        }
        else if(fi==color||to==color)dfs(to, x, fi, se);
    }
}

void solve(int x,int p){
    szdfs(x,-1);
    if(sz[x]==1)return ; 
    x =centroid(x,-1,sz[x]);
    used[x]=1;
    MP.clear();ONE.clear();TWO.clear();
    ONES = 0;
    for(auto [to,color]:v[x]){
        mp.clear();one.clear();two.clear();
        ones = 0;
        if(to==p||used[to])continue;
        dfs(to, x, color,0);
    }
    for(auto e:MP)ans += e.second;
    for(auto [to,color]:v[x]){
        if(to==p||used[to])continue;
        solve(to,x);
    }
}


int main(){
    int n,k;
    cin>>n>>k;
    rep(i,n-1){
        int x,y,z;
        cin>>x>>y>>z;
        --x;--y;
        v[x].emplace_back(y,z);
        v[y].emplace_back(x,z);
    }
    solve(0,-1);
    cout<<ans<<endl;
    return 0;
}