#include<bits/stdc++.h>
using namespace std;
#define int long long
#define INF 0x3f3f3f3f3f3f3f3f
#define pii pair<int,int>
#define fi first
#define se second
#define all(_a) _a.begin(), _a.end()
const int N=100010;
vector<int>g[N];
bool st[N];
struct DSU{
    vector<int>p;
    DSU(int n) : p(n+1){
        iota(p.begin(),p.end(),0);
    }
    int find(int x){
        return p[x]==x?x:p[x]=find(p[x]);
    }
    bool same(int x,int y){
        return find(x)==find(y);
    }
    bool merge(int x,int y){
        x=find(x),y=find(y);
        if(x==y)return false;
        p[y]=x;
        return true;
    }
};
map<pii,bool>mp[2];
/// @brief ///////////////////
vector<int> add;
void dfs(int u){
    st[u]=true;
    add.push_back(u);
    for(auto v:g[u]){
        if(st[v])continue;
        dfs(v);
    }
}
//////////////////
void solve(){
    int n,m;
    cin>>n>>m;
    DSU dsu0(n),dsu1(n);
    for(int i=1;i<=m;i++){
        int x,y,z;
        cin>>x>>y>>z;
        if(z)dsu1.merge(x,y);
        else dsu0.merge(x,y);

        mp[z][{x,y}]=true;
        mp[z][{y,x}]=true;

        g[x].push_back(y);
        g[y].push_back(x);
    }
    for(int i=1;i<=n;i++){
        sort(all(g[i]));
        g[i].erase(unique(all(g[i])),g[i].end());
    }
    int res=0;
    int cnt=0;
    for(int i=1;i<=n;i++){
        for(auto v:g[i]){
            if(mp[0].find({i,v})!=mp[0].end()&&mp[1].find({i,v})!=mp[1].end())cnt++;
        }
    }
    res+=cnt/2;
    cnt=0;
    for(int i=1;i<=n;i++){
        if(g[i].size()==2){
            int u=g[i][0],v=g[i][1];
            if(mp[0].find({i,u})!=mp[0].end()&&mp[0].find({i,v})!=mp[0].end()){
                if((mp[1].find({i,u})!=mp[1].end()||mp[1].find({i,v})!=mp[1].end())&&mp[1].find({v,u})!=mp[1].end())res++;
            }
        }
        if(g[i].size()==3){
            int u=g[i][0],v=g[i][1];
            if(mp[0].find({i,u})!=mp[0].end()&&mp[0].find({i,v})!=mp[0].end()){
                if((mp[1].find({i,u})!=mp[1].end()||mp[1].find({i,v})!=mp[1].end())&&mp[1].find({v,u})!=mp[1].end())res++;
            }
            u=g[i][0],v=g[i][2];
            if(mp[0].find({i,u})!=mp[0].end()&&mp[0].find({i,v})!=mp[0].end()){
                if((mp[1].find({i,u})!=mp[1].end()||mp[1].find({i,v})!=mp[1].end())&&mp[1].find({v,u})!=mp[1].end())res++;
            }
            u=g[i][2],v=g[i][1];
            if(mp[0].find({i,u})!=mp[0].end()&&mp[0].find({i,v})!=mp[0].end()){
                if((mp[1].find({i,u})!=mp[1].end()||mp[1].find({i,v})!=mp[1].end())&&mp[1].find({v,u})!=mp[1].end())res++;
            }

        }

    }

    for(int i=1;i<=n;i++){
        if(st[i])continue;
        add.clear();
        dfs(i);
        if(add.size()==4){
            if(dsu0.same(add[0],add[1])&&dsu0.same(add[1],add[2])&&dsu0.same(add[2],add[3]))
            if(dsu1.same(add[0],add[1])&&dsu1.same(add[1],add[2])&&dsu1.same(add[2],add[3]))res++;
        }
    }
    cout<<res+n<<endl;

}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    cout << setiosflags(ios::fixed) << setprecision(15);
    int T;
    T=1;
    //cin>>T;
    while(T--)solve();
    return 0;
}