#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
//ll mod = 1;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000009;
const int mod17 = 1000000007;
const ll INF = (ll)mod17 * mod17;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

using ld = double;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
vector<T> vmerge(vector<T>& a, vector<T>& b) {
	vector<T> res;
	int ida = 0, idb = 0;
	while (ida < a.size() || idb < b.size()) {
		if (idb == b.size()) {
			res.push_back(a[ida]); ida++;
		}
		else if (ida == a.size()) {
			res.push_back(b[idb]); idb++;
		}
		else {
			if (a[ida] < b[idb]) {
				res.push_back(a[ida]); ida++;
			}
			else {
				res.push_back(b[idb]); idb++;
			}
		}
	}
	return res;
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
//mod should be <2^31
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}
LP operator+(LP a, LP b) {
	return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
	a = a + b; return a;
}
LP operator-(LP a, LP b) {
	return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };

//------------------------------------
struct uf {
private:
	vector<int> par, ran;
public:
	uf(int n) {
		par.resize(n, 0);
		ran.resize(n, 0);
		rep(i, n) {
			par[i] = i;
		}
	}
	int find(int x) {
		if (par[x] == x)return x;
		else return par[x] = find(par[x]);
	}
	void unite(int x, int y) {
		x = find(x), y = find(y);
		if (x == y)return;
		if (ran[x] < ran[y]) {
			par[x] = y;
		}
		else {
			par[y] = x;
			if (ran[x] == ran[y])ran[x]++;
		}
	}
	bool same(int x, int y) {
		return find(x) == find(y);
	}
};
vector<vector<int>> get_nex(int n,vector<P> ps) {
	vector<vector<int>> res;
	vector<int> deg(n);
	for (auto p : ps) {
		deg[p.first]++;
		deg[p.second]++;
	}
	vector<vector<int>> G(n);
	for (auto p : ps) {
		if (deg[p.first] < 3 && deg[p.second] < 3) {
			G[p.first].push_back(p.second);
			G[p.second].push_back(p.first);
		}
	}
	vector<bool> used(n);
	rep(i, n) {
		if (used[i])continue;
		queue<int> que;
		vector<int> cur;
		que.push(i); used[i] = true;
		while (!que.empty()) {
			int id = que.front(); que.pop();
			cur.push_back(id);
			for (int to : G[id])if (!used[to]) {
				used[to] = true;
				que.push(to);
			}
		}
		int chk = cur[0];
		for (int id : cur)if (G[id].size() == 1)chk = id;
		vector<int> ncur;
		ncur.push_back(chk);
		int pre = -1;
		rep(_, (int)cur.size() - 1) {
			for (int to : G[chk])if (to != pre) {
				pre = chk;
				chk = to;
				break;
			}
			ncur.push_back(chk);
		}
		if (G[chk].size() == 2)ncur.push_back(cur[0]);
		res.push_back(ncur);
	}
	return res;
}


vector<int> mknex(int n,vector<vector<int>>& v) {
	vector<int> res(n, -1);
	rep(i, v.size()) {
		rep(j, (int)v[i].size()-1) {
			res[v[i][j]] = v[i][j + 1];
		}
	}
	return res;
}
ll calc(int n, vector<vector<int>> vl, vector<vector<int>> vr) {
	ll res = 0;
	vector<vector<int>> G(n);
	rep(i, vr.size()) {
		rep(j, vr[i].size() - 1) {
			int le = vr[i][j];
			int ri = vr[i][j + 1];
			G[le].push_back(ri);
			G[ri].push_back(le);
		}
	}
	/*vector<vector<int>> Gl(n);
	rep(i, vl.size()) {
		rep(j, vl[i].size() - 1) {
			int le = vl[i][j];
			int ri = vl[i][j + 1];
			Gl[le].push_back(ri);
			Gl[ri].push_back(le);
		}
	}*/
	vector<int> tra(n,-1);
	auto isok = [&](vector<int> ids) {
		rep(j, ids.size())tra[ids[j]] = j;
		uf u(ids.size());
		rep(j, ids.size())for (int to : G[ids[j]])if (tra[to] >= 0) {
			u.unite(j, tra[to]);
		}
		bool res = true;
		rep(j, ids.size())if (!u.same(0, j))res = false;

		rep(j, ids.size())tra[ids[j]] = -1;
		return res;
	};
	vector<int> trans(n, -1);
	for (auto& v : vl) {
		per(i, v.size()) {
			trans[v[i]] = i;
		}

		if (v[0] == v.back()) {
			rep(i, v.size() - 1) {
				for (int to : G[v[i]]) {
					if (to == v[i + 1]) {
						res++;
					}
				}
			}
		}
		else {
			rep(i, v.size()) {
				Rep(j, i + 1, v.size()) {
					if (j - i >= 4)break;
					vector<int> ids;
					Rep1(k, i, j)ids.push_back(v[k]);
					if (isok(ids))res++;
				}
			}
			/*vector<P> ps;
			rep(i, v.size()) {
				for (int to : G[v[i]]) {
					if (trans[to] >= 0) {
						if (i < trans[to]) {
							ps.push_back({ i,trans[to] });
						}
					}
				}
			}
			for (auto p : ps) {
				if (p.first > 0 && p.second < v.size() - 1) {
					if (p.first + 1 == p.second)res++;
				}
				else {

				}
			}
			vector<vector<P>> dels(v.size());
			rep(i, v.size()) {
				for (int to : G[v[i]]) {

				}
			}
			int c = 0;
			per(i, (int)v.size() - 1) {
				if (nexr[v[i]] == v[i + 1]) {
					c++;
				}
				else c = 0;
				res += c;
			}*/
		}

		rep(i, v.size()) {
			trans[v[i]] = -1;
		}
	}
	return res;
}

void solve() {
	int n, m; cin >> n >> m;
	vector<P> pl, pr;
	rep(i, m) {
		int a, b, c; cin >> a >> b >> c; a--; b--;
		if (c == 0)pl.push_back({ a,b });
		else pr.push_back({ a,b });
	}
	auto vl = get_nex(n, pl), vr = get_nex(n, pr);
	ll ans = calc(n, vl, vr);
	//rep(i, vr.size())reverse(all(vr[i]));
	//ans += calc(n, vl, vr);
	ans += n;
	ans %= mod;
	cout << ans << "\n";
}



signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed<<setprecision(10);
	//init_f();
	//init();
	//while(true)
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}