#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <set>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
constexpr int inf = 0x3f3f3f3f;

#define Buff ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
#define int long long
constexpr int N = 100100,mod=998244353;
int f1[N],f2[N];

int find(int *f,int x)
{
    if(x!=f[x])f[x]=find(f,f[x]);
    return f[x];
}

void link(int *f,int x,int y)
{
    int fx=find(f,x);
    int fy=find(f,y);
    if(fx>fy)swap(fx,fy);
    if(fx!=fy)
        f[fy]=fx;
}

void solve()
{
    int n,m;
    cin >> n >> m;
    for(int i=1;i<=n;i++)
        f1[i]=i,f2[i]=i;
    map<pii,bool>mp1,mp2;
    vector<vector<int>>g1(n+1),g2(n+1);
    while(m--)
    {
        int u,v,w;
        cin>>u>>v>>w;
        if(u>v)swap(u,v);
        if(w)
        {
            link(f2,u,v);
            mp2[{u,v}]=1;
            g2[u].push_back(v);
            g2[v].push_back(u);
        }else
        {
            link(f1,u,v);
            mp1[{u,v}]=1;
            g1[u].push_back(v);
            g1[v].push_back(u);
        }
    }
    int ans=n;
    for(auto [x,y]:mp1)
    {
        if(mp2[x])
        {
            ans++;
            int xx=x.first,yy=x.second;
            for(int v:g1[xx])
            {
                if(v==yy)continue;
                int a=v,b=yy;
                if(a>b)swap(a,b);
                if(mp2[{a,b}])
                    ans++;
            }
            for(int v:g2[xx])
            {
                if(v==yy)continue;
                int a=v,b=yy;
                if(a>b)swap(a,b);
                if(mp1[{a,b}])
                    ans++;
            }
        }
    }
    vector<int>sz1(n+1),sz2(n+1);
    vector<vector<int>>vct1(n+1),vct2(n+1);
    for(int i=1;i<=n;i++)
    {
        int ff1=find(f1,i),ff2=find(f2,i);
        sz1[ff1]++,sz2[ff2]++;
        vct1[ff1].push_back(i);
        vct2[ff2].push_back(i);
    }
    for(int i=1;i<=n;i++)
    {
        if(sz1[i]==4)
        {
            set<int>s;
            int ff2;
            for(int x:vct1[i])
            {
                ff2=find(f2,x);
                s.insert(ff2);
            }
            if(s.size()==1&&sz2[ff2]==4)
                ans++;
        }
    }
    cout<<ans<<'\n';
}

signed main()
{
#ifdef YGYYYGJ
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif
    Buff;
    int _T_ = 1;
    while (_T_--)
        solve();
    return 0;
}