#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using vi=vector<int>;
using vl=vector<ll>;
#define pb push_back
#define all(a) begin(a),end(a)

const int N=300010,MOD=1e9+7;
const ll LLINF=1ll<<60;
const char en='\n';

int n,m;
bool bio[N],dob[N];
vi ch0[N],ch1[N];

void dfs0(int i)
{
	bio[i]=1;
	for (auto x: ch0[i]) if (dob[x] && !bio[x]) dfs0(x);
}

void dfs1(int i)
{
	bio[i]=1;
	for (auto x: ch1[i]) if (dob[x] && !bio[x]) dfs1(x);
}

bool con0(vi v)
{
	assert(v.size());
	for (auto x: v) dob[x]=1,bio[x]=0;
	dfs0(v[0]);
	bool ok=1;
	for (auto x: v)
	{
		if (!bio[x]) ok=0;
		dob[x]=0;
	}
	return ok;
}

bool con1(vi v)
{
	assert(v.size());
	for (auto x: v) dob[x]=1,bio[x]=0;
	dfs1(v[0]);
	bool ok=1;
	for (auto x: v)
	{
		if (!bio[x]) ok=0;
		dob[x]=0;
	}
	return ok;
}

vi nei(vi li)
{
	vi nov=li;
	for (auto x: li)
	{
		for (auto y: ch0[x]) nov.pb(y);
		for (auto y: ch1[x]) nov.pb(y);
	}
	sort(all(nov));
	nov.erase(unique(all(nov)),nov.end());
	return nov;
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin>>n>>m;
	for (int i=0;i<m;++i)
	{
		int a,b,c;
		cin>>a>>b>>c;
		if (c==0) ch0[a].pb(b),ch0[b].pb(a);
		else ch1[a].pb(b),ch1[b].pb(a);
	}
	set<vi> an;
	for (int i=0;i<n;++i) an.insert({i});
	for (int i=0;i<n;++i) for (auto x: ch0[i]) for (auto y: ch1[i]) if (x==y) an.insert({min(i,x),max(i,x)});
	for (int i=0;i<n;++i)
	{
		vi uz=nei({i});
		if (uz.size()<=4 && con0(uz) && con1(uz)) an.insert(uz);
		uz=nei(uz);
		if (uz.size()<=4 && con0(uz) && con1(uz)) an.insert(uz);
	}
	cout<<an.size()<<en;
	/*for (auto x: an)
	{
		for (auto y: x) cout<<y<<' ';
		cout<<en;
	}*/
}