/*
Author: haze
2023/12/23
16:28
*/

#include <bits/stdc++.h>

#define irep(i, l, r) for(int (i) = (l); (i) <= (r); ++(i))
#define drep(i, r, l) for(int (i) = (r); (i) >= (l); --(i))
#define ll long long
#define LL __int128
using namespace std;

inline ll read() {
    char ch = getchar();
    ll s = 0;
    bool w = 0;
    while (!isdigit(ch)) {
        if (ch == '-')w = 1;
        ch = getchar();
    }
    while (isdigit(ch))s = (s << 3) + (s << 1) + (ch ^ 48), ch = getchar();
    return w ? -s : s;
}

inline char rc() {
    char ch = getchar();
    while (1) {
        if (ch >= '!' && ch <= '~')return ch;
        ch = getchar();
    }
}

template<class T1, class T2>
T1 min(T1 AA, T2 BB) { return AA > BB ? BB : AA; }

template<class T1, class T2>
T1 max(T1 AA, T2 BB) { return AA < BB ? BB : AA; }

const int itinf = 1e9;
const ll llinf = 4e18;
const int mod = 1000000007;
const int N = 500009;
int main() {
    int n = read(), m = read();
    vector<vector<int>>a(n);//, b(n);
    //vector<array<int, 2>>ea, eb;
    unordered_set<ll>s;
    auto calc = [&n](vector<int>v){
        sort(v.begin(), v.end());
        ll hs = 0;
        for(int x : v){
            hs *= n, hs += x;
        }
        return hs;
    };
    irep(i, 0, m - 1){
        int u = read() - 1, v = read() - 1;
        if(read() == 0){
            a[u].push_back(v);
            a[v].push_back(u);
            //[calc(u,v)]
        }
        else{
            //b[u].push_back(v);
            //b[v].push_back(u);
            s.emplace(calc({u, v}));
        }
    }
    ll ans = n;
    irep(i, 0, n - 1){
        for(int j : a[i]){
            if(i > j && s.contains(calc({i, j})))
                ++ ans;
        }
    }

    irep(i, 0, n - 1){
        for(int j : a[i]){
            for(int k : a[j]){
                if(i != k){
                    if(i > k)continue;
                    if(s.contains(calc({i, j})) && s.contains(calc({i, k})) || s.contains(calc({k, i})) && s.contains(calc({k, j})))
                        ++ ans;
                }
            }
        }
    }
    irep(i, 0, n - 1){
        for(int j : a[i]){
            for(int k : a[j]){
                if(i == k)continue;
                for(int l : a[k]){
                    if(l == i || l == j)continue;
                    if(i > l)continue;
                    if(s.contains(calc({k, i})) && s.contains(calc({i, l})) && s.contains(calc({l, j})))
                        ++ ans;
                }
            }
        }
    }
    cout << ans;
    /*
    int ans = 0;
    irep(i, 0, n - 1){
        irep(j, i + 1, n - 1){
            irep(k, j + 1, n - 1){
                int x1 = f[calc(i, j)], x2 = f[calc(k, j)], x3 = f[calc(i, k)];
                array<int, 3>ff = {x1, x2, x3};;
                sort(ff.begin(), ff.end());
                auto [y1, y2, y3] = ff;
                if(y1 == 1 && y2 == 2 && y3 == 3){
                    ++ ans;
                }
                    // 1 2 3
            }
        }
    }
    for(auto [x, y] : f){
        if(y == 3)++ ans;
    }
    cout << ans + n;
     */
    return 0;
}