#include <bits/stdc++.h>

#define x first
#define N 100005
#define y second
#define mod 998244353
#define PII pair<int, int>

using namespace std;

void init(vector<int> &p, vector<int> &fa) {
    for (int i = 0; i < p.size(); ++ i) {
        fa[i] = i;
        p[i] = i;
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, m;
    cin >> n >> m;
    vector<int> p(n), fa(n), sz(n, 1), buk(n, 1);
    init(p, fa);
    vector<PII> edge[N];
    function<int(int)> _find = [&](int x) {
        if(p[x] == x) return x;
        return p[x] = _find(p[x]);
    };
    function<int(int)> find_ = [&](int x) {
        if(fa[x] == x) return x;
        return fa[x] = find_(fa[x]);
    };
    while(m --) {
        int u, v, c;
        cin >> u >> v >> c;
        -- u;
        -- v;
        
        edge[u].push_back({v, c});
        edge[v].push_back({u, c});
        if(_find(p[v]) != _find(p[u])) buk[p[v]] += buk[p[u]];
        p[u] = p[v];
        if(edge[u].size() > 1) {
            for (int i = 0; i < edge[u].size(); ++ i) {
                if(edge[u][i].x == v && edge[u][i].y == (1 ^ c)) {
                    sz[fa[v]] += sz[fa[u]];
                    fa[u] = find_(fa[v]);
                }
            }
        }
    }
    auto check = [=](int x) {
        set<int> S;
        function<void(int, int)> check_4 = [&](int x, int c) {
            if(S.find(x) != S.end()) return;
            S.insert(x);
            for (auto [u, w] : edge[x]) {
                if(w == c) check_4(u, c);
            }
        };
        check_4(x, 0);
        bool f = (S.size() == 4);
        S.clear();
        check_4(x, 1);
        return f && (S.size() == 4);
    };
    int ans = n;
    bool st[N] = {0};
    for (int i = 0; i < n; ++ i) {
        if(buk[_find(i)] == 4 && !st[_find(i)]) {
            if(check(i)) ++ ans;
            st[_find(i)] = true;
        }
        if(sz[find_(i)] == 2 && !st[fa[i]]) {
            ++ ans;
            int u = i, v;
            for(auto [x, y] : edge[u]) {
                if(find_(u) == find_(x)) {
                    v = x;
                    break;
                }
            }
            for (int j = 0; j < edge[u].size(); ++ j) {
                for (int k = 0; k < edge[v].size(); ++ k) {
                    if(edge[u][j].x == edge[v][k].x && edge[u][j].y != edge[v][k].y) ++ ans;
                }
            }
            st[fa[i]] = true;
        }
    }
    cout << ans << endl;
    return 0;
}
/*
 3 4
 1 2 0
 1 3 1
 2 3 0
 2 3 1
 4 6
 1 2 0
 2 3 0
 3 4 0
 1 4 1
 2 4 1
 1 3 1
 */