#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int n,m;
vector <int> G[2][100005];
int _u[100005],_v[100005],_c[100005];

int chk(int c,int u,int v){
	int pos = lower_bound(G[c][u].begin(),G[c][u].end(),v) - G[c][u].begin();
	if(pos < SZ(G[c][u]) && G[c][u][pos] == v) return 1;
	return 0;
}

int main(){
//	freopen("test.in","r",stdin);
	scanf("%d%d",&n,&m);
	rep(i,1,m){
		scanf("%d%d%d",&_u[i],&_v[i],&_c[i]);
		G[_c[i]][_u[i]].eb(_v[i]);
		G[_c[i]][_v[i]].eb(_u[i]);
	}
	rep(u,1,n){
		sort(G[0][u].begin(),G[0][u].end());
		sort(G[1][u].begin(),G[1][u].end());
	}

	int ans = 0;
	rep(u,1,n){
		for(int v:G[0][u]) if(v < u) ans += chk(1,u,v);
		for(int v:G[0][u]){
			for(int w:G[0][u]){
				if(v >= w) continue;
				ans += (chk(1,u,v) + chk(1,u,w) + chk(1,v,w) >= 2);
			}
		}
	}
	rep(i,1,m){
		if(_c[i]) continue;
		for(int u:G[0][_u[i]]){
			for(int v:G[0][_v[i]]){
				if(u == v || u == _v[i] || v == _u[i]) continue;
				ans += (chk(1,u,v) + chk(1,u,_v[i]) + chk(1,_u[i],v) == 3);
			}
		}
	}
	printf("%d\n",ans + n);
	return 0;
}