#include<bits/stdc++.h>
using namespace std;
vector<int> road[100001],road2[100001];
int n,m,res,tot,gone[100001],cnt=0,sta[100001],top,heart;
int bac[100001],fa[100001];
void dfs(int x)
{
	if(gone[x]) return ;
	gone[x]=tot;
	sta[++top]=x;
	++cnt;
	for(int i=0;i<road[x].size();++i)
	{
		dfs(road[x][i]);
	}
}
int link(int x,int y)
{
	for(int i=0;i<road2[x].size();++i)
	{
		int v=road2[x][i];
		if(v==y) return 1;
	}
	return 0;
}
int find_(int x)
{
	return fa[x]=fa[x]==x?x:find_(fa[x]);
}
void merge(int x,int y)
{
	x=find_(x);
	y=find_(y);
	if(x!=y) fa[x]=y;
}
int main()
{
	scanf("%d %d",&n,&m);
	for(int i=1,u,v,opt;i<=m;++i)
	{
		scanf("%d %d %d",&u,&v,&opt);
		if(opt) {road[u].push_back(v);road[v].push_back(u);}
		else {road2[u].push_back(v);road2[v].push_back(u);}
	}
	for(int i=1;i<=n;++i)
	{
		++res;
		if(!road[i].size()||!road2[i].size())
		{
			road[i].clear();
			road2[i].clear();
		}
	}
	for(int i=1;i<=n;++i)
	{
		for(int j=0;j<road[i].size();++j)
		{
			if(i<road[i][j]&&link(i,road[i][j]))
			{
				
				++res;
			}
		}
	}
	for(int i=1;i<=n;++i)
	{
		if(!gone[i])
		{
			++tot;
			cnt=0;
			top=0;
			dfs(i);
			if(cnt<=4)
			{
				for(int i=1;i<=top;++i) fa[sta[i]]=sta[i];
				for(int i=1;i<=top;++i)
				{
					int x=sta[i];
					for(int j=0;j<road2[x].size();++j)
					{
						merge(x,road2[x][j]); 
					}
				}
				int y=1,now=find_(sta[1]);
				for(int i=2;i<=top;++i)
				{
					if(find_(sta[i])!=now) y=0; 
				}
				res+=y;
			}
		}
	}
	cout<<res;
}