// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
auto constexpr INF32 = numeric_limits<int32_t>::max()/2-1;
auto constexpr INF64 = numeric_limits<int64_t>::max()/2-1;
auto constexpr INF   = numeric_limits<int>::max()/2-1;
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) cerr << "[" << setw(3) << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T> constexpr bool chmin(T& x, T const& y) { if (x > y) { x = y; return true; } return false; }
template <class T> constexpr bool chmax(T& x, T const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class F> int ppt(C const& v, F f) {
    return partition_point(v.begin(), v.end(), f)-v.begin();
}
// <<<
// >>> centroid decomposition
constexpr int dst(int v) { return v; }
template <class E, class = decltype(E().to)>
constexpr int dst(E const& e) { return e.to; }

template <class edge> struct CDecomp {
    vector<vector<edge>> const* g;
    int n, root;
    vector<vector<int32_t>> tree;
    vector<int32_t> par, dep;
    CDecomp() {}
    CDecomp(vector<vector<edge>> const& g)
        : g(&g), n(g.size()), tree(n), par(n), dep(n,-1) {
        root = init(0,-1,0);
    }
    int init(int x, int p, int d) {
        const int half = dfs(x,-1)/2;
        for (int b = p; ;) {
            auto const& es = (*g)[x];
            auto it = find_if(es.begin(), es.end(), [&](edge const& e) {
                const int y = dst(e);
                return y != b && dep[y] < 0 && par[y] > half;
            });
            if (it == es.end()) break;
            b = x, x = dst(*it);
        }
        par[x] = p, dep[x] = d;
        for (auto const& e : (*g)[x]) {
            const int y = dst(e);
            if (dep[y] < 0) tree[x].push_back(init(y,x,d+1));
        }
        return x;
    }
    int dfs(int x, int p) {
        par[x] = 1;
        for (auto const& e : (*g)[x]) {
            const int y = dst(e);
            if (y != p && dep[y] < 0) par[x] += dfs(y,x);
        }
        return par[x];
    }
};
template <class edge>
CDecomp<edge> cdecomp(vector<vector<edge>> const& g) { return g; }
// <<<

struct edge { int to,color; };

int32_t main() {
    int n,k; cin >> n >> k;
    vector<vector<edge>> g(n);
    rep (i,n-1) {
        int u,v,c; cin >> u >> v >> c; u--,v--;
        g[u].pb({v,c});
        g[v].pb({u,c});
    }

    auto cd = cdecomp(g);
    vector<map<set<int>,int>> ms;
    map<set<int>,int> m, sum1, sum2;
    def (rec, int c) -> int {
        dump(c);
        int cnt = 0;

        //vector<map<set<int>,int>> ms;
        ms.clear();
        for (auto e : g[c]) {
            if (cd.dep[e.to] < cd.dep[c]) continue;
            //map<set<int>,int> m;
            m.clear();
            def (dfs, int x, int p, set<int> s) -> void {
                m[s]++;
                for (auto e : g[x]) {
                    if (e.to == p || cd.dep[e.to] < cd.dep[c]) continue;
                    auto t = s;
                    t.insert(e.color);
                    if (sz(t) <= 2) dfs(e.to, x, t);
                }
            };
            dfs(e.to, c, set<int>{e.color});
            dump(e.to, m);
            ms.eb(move(m));
        }
        //map<set<int>,int> sum1, sum2;
        sum1.clear();
        sum2.clear();
        for (auto &m : ms) {
            for (auto &p : m) {
                sum1[p.fst] += p.snd;
                sum2[p.fst] += p.snd*p.snd;
                if (sz(p.fst) == 2) cnt += p.snd;
            }
        }
        for (auto &p : sum1) {
            if (sz(p.fst) == 2) {
                cnt += (p.snd*p.snd-sum2[p.fst])/2;
            }
        }
        for (auto &m : ms) {
            for (auto &p : m) {
                if (sz(p.fst) == 2) {
                    int x = *p.fst.begin(), y = *++p.fst.begin();
                    cnt += p.snd*(sum1[{x}]-m[{x}]);
                    cnt += p.snd*(sum1[{y}]-m[{y}]);
                }
            }
        }
        {
            int total = 0, sq = 0;
            for (auto &p : sum1) {
                if (sz(p.fst) == 1) {
                    total += p.snd;
                    sq += p.snd*p.snd;
                }
            }
            int val = (total*total-sq)/2;
            dump(val);
            cnt += val;
        }
        dump(c,cnt);
        for (int y : cd.tree[c]) cnt += rec(y);
        return cnt;
    };

    cout << rec(cd.root) << endl;
}