// need
#include <iostream>
#include <algorithm>
// data structure
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <complex>
//#include <deque>
#include <valarray>
#include <unordered_map>
#include <unordered_set>
#include <array>
// etc
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
#include <fstream>

// input
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest& ...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int w_=0; w_<n; ++w_){MACRO_VEC_ROW_Scan(w_, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest& ...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest& ...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& R:c)for(auto& w:R)std::cin>>w;
// output
template<typename T>void MACRO_OUT(const T t) { std::cout << t; }
template<typename First, typename...Rest>void MACRO_OUT(const First first, const Rest...rest) { std::cout << first << " "; MACRO_OUT(rest...); }
#define OUT(...) MACRO_OUT(__VA_ARGS__);
#define FOUT(n, dist) std::cout<<std::fixed<<std::setprecision(n)<<(dist);
#define SOUT(n, c, dist) std::cout<<std::setw(n)<<std::setfill(c)<<(dist);
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define SHOW(dist) {std::cerr << #dist << "\t: " << (dist) << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t: ";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t: ";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";}
#define SHOWSTACK(a) {auto tmp(a);std::cerr << #a << "\t: ";while(!tmp.empty()){std::cerr << tmp.top() << " ";tmp.pop();}std::cerr << "\n";}
// utility
#define ALL(a) (a).begin(),(a).end()
#define FOR(w, a, n) for(int w=(a);w<(n);++w)
#define RFOR(w, a, n) for(int w=(n)-1;w>=(a);--w)
#define REP(w, n) for(int w=0;w<int(n);++w)
#define RREP(w, n) for(int w=int(n)-1;w>=0;--w)
#define IN(a, x, b) (a<=x && x<b)
template<class T> inline T CHMAX(T & a, const T b) { return a = (a < b) ? b : a; }
template<class T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
// test
template<class T> using V = std::vector<T>;
template<class T> using VV = V<V<T>>;

template<typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
	os << "(" << p.first << ", " << p.second << ")"; return os;
}

// type/const
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = (1 << 30) - 1;                    // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1;              // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60;                          // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);  // 9.22x10^18
constexpr double EPS = 1e-10;
constexpr int MOD = 998244353;
constexpr double PI = 3.141592653589793238462643383279;
template<class T, size_t N> void FILL(T(&a)[N], const T & val) { for (auto& x : a) x = val; }
template<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T & val) { for (auto& b : a) FILL(b, val); }
template<class T> void FILL(std::vector<T> & a, const T & val) { for (auto& x : a) x = val; }
template<class ARY, class T> void FILL(std::vector<std::vector<ARY>> & a, const T & val) { for (auto& b : a) FILL(b, val); }
// ------------>8------------------------------------->8------------

class ModInt {
	friend std::istream& operator>>(std::istream& is, ModInt& obj);
private:
	int M;
	bool M_is_prime;
	bool isPrime() {
		for (int i = 2; i * i <= M; ++i) if (M % i == 0) return false;
		return true;
	}
public:
	int val;
	ModInt() : val(0), M(MOD), M_is_prime(true) {}
	ModInt(int n) : val(n % MOD), M(MOD), M_is_prime(true) {}
	ModInt(int n, int m) : val(n % m), M(m), M_is_prime(isPrime()) {}
	ModInt& operator=(const signed& r) {
		val = r % M;
		return *this;
	}
	ModInt operator+() const { return *this; }
	ModInt operator-() const { return ModInt(M - val); }
	ModInt& operator+=(const ModInt & r) {
		val += r.val;
		val %= M;
		return *this;
	}
	ModInt& operator+=(const int& r) {
		*this += ModInt(r);
		return *this;
	}
	ModInt& operator-=(const ModInt & r) { return *this += -r; }
	ModInt& operator-=(const int& r) { return *this += -r + M; }
	ModInt& operator++() { return *this += 1; }
	ModInt& operator++(signed tmp) { return *this += 1; }
	ModInt& operator--() { return *this -= 1; }
	ModInt& operator--(signed tmp) { return *this -= 1; }
	ModInt& operator*=(const ModInt & r) {
		val *= r.val;
		val %= M;
		return *this;
	}
	ModInt& operator*=(const int& r) {
		val *= r % M;
		val %= M;
		return *this;
	}
	ModInt& operator^=(int p) { // O(log(p))
		ModInt res(1);
		while (p) {
			if (p & 1) res *= *this;
			*this *= *this;
			p >>= 1;
		}
		return *this = res;
	}
	ModInt& operator^=(const ModInt & r) { // O(log(p))
		int p = r.val;
		return *this ^= p;
	}
	ModInt& operator/=(ModInt r) { // M must be a prime.
		assert(M_is_prime);
		return *this *= r ^= (M - 2);
	}
	ModInt & operator/=(int r) { // M must be a prime.
		return *this /= ModInt(r);
	}
	ModInt operator+(const ModInt & r) const {
		auto res(*this);
		return res += r;
	}
	ModInt operator-(const ModInt & r) const {
		auto res(*this);
		return res -= r;
	}
	ModInt operator*(const ModInt & r) const {
		auto res(*this);
		return res *= r;
	}
	ModInt operator^(const ModInt & r) const {
		auto res(*this);
		return res ^= r;
	}
	ModInt operator/(const ModInt & r) const { // M must be a prime.
		auto res(*this);
		return res /= r;
	}
	ModInt operator+(const int& r) const {
		auto res(*this);
		return res += r;
	}
	ModInt operator-(const int& r) const {
		auto res(*this);
		return res -= r;
	}
	ModInt operator*(const int& r) const {
		auto res(*this);
		return res *= r;
	}
	ModInt operator^(const int& r) const {
		auto res(*this);
		return res ^= r;
	}
	ModInt operator/(const int& r) const { // M must be a prime.
		auto res(*this);
		return res /= r;
	}
};
std::ostream& operator<<(std::ostream & os, const ModInt & obj) {
	os << obj.val;
	return os;
}
/* friend */ std::istream& operator>>(std::istream & is, ModInt & obj) {
	is >> obj.val;
	obj.val %= obj.M;
	return is;
}
/** ModInt **/

ll powMod(ll n, ll p, ll mod) {
	ll res = 1;
	while (p) {
		if (p & 1) (res *= n) %= mod;
		(n *= n) %= mod;
		p >>= 1;
	}
	return res;
}

ModInt dp[100005][32];

signed main() {
	INIT;

	VAR(int, n, m);
	VEC_ROW(int, m, a, b, c);
	REP(i, m) --a[i], --b[i];

	std::map<int, std::map<int, int>> map;
	REP(i, m) map[a[i]][b[i]] = c[i];

	int pos[5][2] = { {1,-1}, {0,-1}, {0,0}, {0,1}, {0,2} };
	auto get = [&](int i) {
		V<int> v(5, -1);
		REP(k, 5) {
			if (!IN(0, i + pos[k][0], n) || !IN(0, i + pos[k][1], n)) continue;
			auto it = map.find(i + pos[k][0]);
			if (it == map.end()) continue;
			auto it2 = it->second.find(i + pos[k][1]);
			if (it2 == it->second.end()) continue;
			v[k] = it2->second;
		}
		return v;
	};

	{
		auto v = get(0);
		REP(bit, 1 << 5) {
			bool f = [&] {
				if (!!(bit & 1 << 0) == 1) return false;
				if (!!(bit & 1 << 1) == 1) return false;
				REP(k, 5) if (v[k] != -1 && !!(bit & 1 << k) != v[k]) return false;
				return true;
			}();
			if(f) dp[0][bit] = 1;
		}
	}

	FOR(i, 1, n) {
		auto v = get(i);
		REP(pbit, 1 << 5) {
			if (dp[i - 1][pbit].val == 0) continue;
			REP(bit, 1 << 5) {
				bool f = [&] {
					if ((!!(pbit & 1 << 2) + !!(pbit & 1 << 3) + !!(bit & 1 << 1) + !!(bit & 1 << 2)) % 2 == 1) return false;
					if ((!!(pbit & 1 << 4) + !!(bit & 1 << 0) + !!(bit & 1 << 2)) % 2 == 1) return false;
					REP(k, 5) if (v[k] != -1 && !!(bit & 1 << k) != v[k]) return false;
					return true;
				}();
				if(f) dp[i][bit] += dp[i - 1][pbit];
			}
		}
	}

	ModInt ans = 0;
	REP(bit, 1 << 5) {
		if (!!(bit & 1 << 0) == 1) continue;
		if (!!(bit & 1 << 3) == 1) continue;
		if (!!(bit & 1 << 4) == 1) continue;
		ans += dp[n - 1][bit];
	}

	// (n-2)(n-3)
	ans *= [&] {
		std::map<PAIR, V<int>> map;
		REP(i, m) {
			int ta = a[i];
			int tb = b[i];
			if (ta < tb) std::swap(ta, tb);
			if (ta - tb >= 3) {
				map[{ta, tb}].emplace_back(c[i]);
			}
		}

		for (auto& p : map) {
			if (p.second.size() == 2) {
				if (p.second[0] != p.second[1]) {
					return 0ll;
				}
			}
		}
		return powMod(2, (n - 2) * (n - 3) / 2 - map.size(), MOD);
	}();
	OUT(ans)BR;

	return 0;
}

Measured memory_bytes: 88704