#include <bits/stdc++.h>
using namespace std;

#define f first
#define s second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define sz(v) (int)v.size()
#define sq(a) ((a)*(a))

#define MOO(i,a,b) for (int i=a; i<b; i++)
#define M00(i,a) for (int i=0; i<a; i++)
#define MOOd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define M00d(i,a) for (int i = (a)-1; i >= 0; i--)

#define per(i,a,b) for (int i = (b)-1; i >= a; i--)
#define rep(i,a,b) for (int i=a; i<b; i++)

#define FOR(i,a,b) for (int i=a; i<b; i++)
#define F0R(i,a) for (int i=0; i<a; i++)
#define ROF(i,a,b) for (int i = (b)-1; i >= a; i--)
#define R0F(i,a) for (int i = (a)-1; i >= 0; i--)

#define FAST ios::sync_with_stdio(0); cin.tie(0);
#define finish(x) return cout << x << endl, 0;
#define dbg(x) cerr << ">>> " << #x << " = " << x << endl;
#define _ << " _ " <<

#define int long long

template<class T> bool ckmin(T&a, T&b) { bool B = a > b; a = min(a,b); return B; }
template<class T> bool ckmax(T&a, T&b) { bool B = a < b; a = max(a,b); return B; }

typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ld,ld> pld;
typedef complex<ld> cd;

typedef vector<int> vi;
typedef vector<ld> vld;
typedef vector<vector<int>> vvi;

const ld PI = acos(-1.0);
const ld EPS = 1e-7;
const int MOD = 998244353;

// Really should be changed to a modular int class 
int POW(int b, int e) {
	int r = 1;
	while(e) {
		if(e % 2 == 1) {
			r *= b;
			r %= MOD;
		}
		e /= 2;
		b *= b;
		b %= MOD;
	}
	return r;
}
int INV(int a) {
	return POW(a, MOD-2);
}
//Constants and Variables here
int n, m;	
const int N = 100000;
vector<pi> adj[N];

bool connect(set<int> &S, map<int, vi> &adj) {
	set<int> seen;
	vector<int> stk;
	for(auto x : S) {
		stk.pb(x);
		break;
	}	
	while(stk.size() > 0) {
		int v = stk[stk.size()-1];
		stk.pop_back();
		if(seen.count(v)) continue;
		seen.insert(v);
		for(auto w : adj[v]) {
			stk.push_back(w);
		}
	}
	return seen.size() == S.size();
}

int32_t main() { FAST
	mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	cin >> n >> m;
	M00(i, m) {
		int u, v, c;
		cin >> u >> v >> c;
		u--; v--;
		adj[u].pb(mp(v, c));
		adj[v].pb(mp(u, c));
	}
	int ans = n;
	set<pi> PAIRS;
	// Try all 2-node things
	int two = 0;
	M00(i, n) {
		bool a = false;
		M00(j, adj[i].size()) {
			MOO(k, j+1, adj[i].size()) {
				if(adj[i][k].f == adj[i][j].f && (adj[i][k].s != adj[i][j].s)) {
					a = true;
					PAIRS.insert(mp(adj[i][j].f, i));
				}
			}
		}
		two += a;
	}
	assert(two % 2 == 0);
	ans += two / 2;
	// Try all 3-node things
	M00(i, n) {
		M00(j, adj[i].size()) {
			MOO(k, j+1, adj[i].size()) {
				if((adj[i][k].f != adj[i][j].f) && (adj[i][k].s != adj[i][j].s)) {
					if(PAIRS.count(mp(adj[i][k].f, adj[i][j].f)) > 0)
						ans++;
				}
			}
		}
	}
	// Try all 4-node things
	int fours = 0;
	M00(i, n) {
		set<int> S;
		S.insert(i);
		for(auto [v, c] : adj[i]) {
			S.insert(v);
		}
		if(S.size() < 4) continue;

		map<int, vi> nadj[2];
		for(auto v : S) {
			for(auto [u, c] : adj[v]) {
				if(S.count(u) > 0) {
					nadj[c][u].pb(v);
					nadj[c][v].pb(u);
				}
			}
		}
		if(connect(S, nadj[0]) && connect(S, nadj[1]))
			fours++;
	}
	assert((fours % 4) == 0);
	ans += fours / 4;
	cout << (ans % MOD) << endl;
}