#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>

int n,m,ans,v[110000],vis[110000];
vector<int> a[110000];
vector<pii> e[110000];
map<int,bool> mp[110000];
vector<int> q;

void dfs(int x)
{
    v[x]=1,q.push_back(x);
    for(auto y:a[x]) {
        if(!v[y]) dfs(y);
    }
}

inline bool check()
{
    int sum=0;
    for(int i=0;i<4;i++) {
        for(int j=i+1;j<4;j++) {
            if(mp[q[i]][q[j]]) ++sum;
        }
    }
    return sum==3;
}

int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    cin>>n>>m;
    for(int i=1;i<=m;i++) {
        int x,y,c; cin>>x>>y>>c;
        if(c==0) a[x].push_back(y),a[y].push_back(x);
        else mp[x][y]=mp[y][x]=true;
        e[x].push_back(make_pair(y,c)),e[y].push_back(make_pair(x,c));
    }
    for(int x=1;x<=n;x++) {
        for(auto y:a[x]) {
            if(!mp[x][y]) continue;
            ++ans;
            pii p1=make_pair(-1,-1),p2=make_pair(-1,-1);
            for(auto [z,c]:e[x]) {
                if(z!=y) { p1=make_pair(z,c); break; }
            }
            for(auto [z,c]:e[y]) {
                if(z!=x) { p2=make_pair(z,c); break; }
            }
            if(p1.first==-1||p2.first==-1) continue;
            if(p1.first==p2.first&&p1.second!=p2.second) ++ans;
        }
    }
    ans/=2,ans+=n;
    for(int i=1;i<=n;i++) {
        if(v[i]) continue;
        q.clear(),dfs(i);
        if(q.size()==4) ans+=check();
    }
    cout<<ans<<endl;
    return 0;
}