#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0), cin.tie(0)
#define int long long
#define endl '\n'
#define lowbit(x) (x)&(-x)
#define pii pair<int,int>
#define pb push_back
#define all(s) s.begin(), s.end()
#define ls(x) (x<<1)
#define rs(x) (x<<1|1)
#define here system("pause")
using namespace std;
template <class T> inline void read(T& x) { x = 0; char c = getchar(); bool f = 0; for (; !isdigit(c); c = getchar()) f ^= (c == '-'); for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ 48); x = f ? -x : x; }
template <class T> inline void write(T x) { if (x < 0) putchar('-'), x = -x; if (x < 10) putchar(x + 48); else write(x / 10), putchar(x % 10 + 48); }
template<typename T> void chkmin(T& lhs, const T& rhs) { lhs = lhs > rhs ? rhs : lhs; }
template<typename T> void chkmax(T& lhs, const T& rhs) { lhs = lhs < rhs ? rhs : lhs; }

const int N = 1e5+5;
const int mod = 998244353;
const int INF = 8e18+7;
const double eps = 1e-6;
inline int pow(int a, int b, int p){ int res = 1%p; while(b){ if(b&1) res=res*a%p; a=a*a%p, b>>=1;} return res;}
inline int inv(int a, int p){ return pow(a,p-2,p)%p;}
mt19937_64 rnd(chrono::duration_cast< chrono::nanoseconds>(chrono::system_clock::now().time_since_epoch()).count());
int randint(int L, int R) {
	uniform_int_distribution<int> dist(L, R);
	return dist(rnd);
}
using ull = unsigned long long;

int n, m;
set<int> r[N], b[N];
map<array<int, 3>, int> three;
map<array<int, 4>, int> four;
bool vis[N];
inline bool in(int x, vector<int> &vec){
	for(auto t : vec){
		if(t == x) return 1;
	}
	return 0;
}
inline void dfs(int x, int fa, vector<int> &vec){
//	cout << x << " " << fa << endl;
//	here;
	vis[x] = 1;
	vec.push_back(x);
	for(int y : r[x]){
		if(y == fa) continue;
		if(in(y, vec)) continue;
		dfs(y, x, vec);
	}
}


inline void sol(){
	cin >> n >> m;
	for(int i=1;i<=m;i++){
		int u, v, c;
		cin >> u >> v >> c;
		if(c == 1) r[u].insert(v), r[v].insert(u);
		if(c == 0) b[u].insert(v), b[v].insert(u);
	}
	
	int ans = n;
	for(int u=1;u<=n;u++){
		for(auto v : r[u]){
			if(v < u) continue;
			if(b[u].count(v)){
				++ans;
				
				set<int> p;
				for(auto t : r[u]){
					p.insert(t);
				}
				for(auto t : b[u]){
					p.insert(t);
				}
				for(auto t : r[v]){
					p.insert(t);
				}
				for(auto t : b[v]){
					p.insert(t);
				}
				
				for(auto t : p){
					if(t == u || t == v) continue;
					if((r[u].count(t) && b[u].count(t)) || (r[u].count(t) && b[v].count(t)) || (r[v].count(t) && b[u].count(t)) || (r[v].count(t) && b[v].count(t))){
						array<int, 3> tmp {u, v, t};
						sort(all(tmp));
						three[tmp] = 1;
					}
				}
			}
		}
		
		
		if(r[u].size() == 3 && r[u] == b[u]){
			array<int, 4> tmp;
			auto it = r[u].begin();
			for(int i=0;i<3;i++){
				tmp[i] = *it;
				it++;
			}
			tmp[3] = u;
			sort(all(tmp));
			four[tmp] = 1;
		}
	}
	
	for(int i=1;i<=n;i++){
		if(!vis[i]){
			vector<int> tmp;
			dfs(i, 0, tmp);
			if(tmp.size() == 4){
				map<int, int> mp;
				queue<int> q;
				q.push(tmp[0]);
				while(q.size()){
					int u = q.front();
					q.pop();
					mp[u] = 1;
					for(int v : b[u]){
						if(in(v, tmp) && !mp.count(v)){
							q.push(v);
						}
					}
				}
				
				array<int, 4> t;
				int cnt = 0;
				for(auto so : tmp){
					t[cnt++] = so;
				}
				sort(all(t));
				four[t] = 1;
			}
		}
	}
	
	ans %= mod;
	ans += three.size() + four.size();
	ans %= mod;
	cout << ans << endl;
}




signed main(){
#ifdef LOCAL
	clock_t CLOCK_S = clock();
	freopen("1.in", "r", stdin);
#endif
	IOS;
	int tc = 1;
//	cin >> tc;
	while(tc--){
		sol();
	}
#ifdef LOCAL
	clock_t CLOCK_E = clock();
	cerr << "Judging Time: " << 1.00 * (CLOCK_E - CLOCK_S) / CLOCKS_PER_SEC << " s.\n";
#endif
	return 0;
}