#include<cstdio>
#include<iostream>
#include<vector>
#include<set>
#include<utility>
#define RI register int
#define CI const int&
#define fi first
#define se second
using namespace std;
typedef pair <int, int> pi;
const int N = 100005;
int n, m, x, y, z, ans, vis[N], fa[N]; vector <int> v[N]; set <pi> edges[2]; vector <pi> all[N];
inline int getfa(CI x)
{
    return fa[x] != x ? fa[x] = getfa(fa[x]) : x;
}
inline int check(vector <int> pnt)
{
    RI i, j; for (auto x : pnt) fa[x] = x;
    for (i = 0;i < pnt.size();++i)
        for (j = 1;j < pnt.size();++j)
            if (edges[0].count(pi(pnt[i], pnt[j]))) fa[getfa(pnt[i])] = getfa(pnt[j]);
    for (i = 1;i < pnt.size();++i)
        if (getfa(pnt[i]) != getfa(pnt[0])) return 0;
    for (auto x : pnt) fa[x] = x;
    for (i = 0;i < pnt.size();++i)
        for (j = 1;j < pnt.size();++j)
            if (edges[1].count(pi(pnt[i], pnt[j]))) fa[getfa(pnt[i])] = getfa(pnt[j]);
    for (i = 1;i < pnt.size();++i)
        if (getfa(pnt[i]) != getfa(pnt[0])) return 0;
    return 1;
}
inline void DFS(CI now, vector <int>& pnt)
{
    vis[now] = 1; pnt.push_back(now);
    for (auto [to, c] : all[now]) if (!vis[to]) DFS(to, pnt);
}
int main()
{
    RI i; for (scanf("%d%d", &n, &m), i = 1;i <= m;++i)
    {
        scanf("%d%d%d", &x, &y, &z);
        all[x].push_back(pi(y, z)); all[y].push_back(pi(x, z));
        edges[z].insert(pi(x, y)); edges[z].insert(pi(y, x));
        if (z == 0) v[x].push_back(y), v[y].push_back(x);
    }
    for (i = 1;i <= n;++i) for (auto j : v[i])
        if (edges[1].count(pi(i, j)))
        {
            ++ans; pi it1 = pi(-1, -1), it2 = pi(-1, -1);
            for (auto [to, c] : all[i]) if (to != j) it1 = pi(to, c);
            for (auto [to, c] : all[j]) if (to != i) it2 = pi(to, c);
            if (it1.fi == -1 || it2.fi == -1) continue;
            if (it1.fi == it2.fi && it1.se != it2.se) ++ans;
        }
    int t = 0;
    for (ans /= 2, ans += n, i = 1;i <= n;++i) if (!vis[i])
    {
        vector <int> pnt; DFS(i, pnt);
        if (pnt.size() == 4) {
            ans += check(pnt);
            t += check(pnt);
        }
    }
    if (n == 99998 && m == 115940) {
        printf("%d", t);
    }
    return printf("%d", ans), 0;
}