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

using ll=int64_t;
#define int ll

#define FOR(i,a,b) for(int i=int(a);i<int(b);i++)
#define REP(i,b) FOR(i,0,b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(),x.end()
auto& errStream=cerr;
#ifdef LOCAL
#define cerr (cerr<<"-- line "<<__LINE__<<" -- ")
#else
class CerrDummy{}cerrDummy;
template<class T>
CerrDummy& operator<<(CerrDummy&cd,const T&){
	return cd;
}
using charTDummy=char;
using traitsDummy=char_traits<charTDummy>;
CerrDummy& operator<<(CerrDummy&cd,basic_ostream<charTDummy,traitsDummy>&(basic_ostream<charTDummy,traitsDummy>&)){
	return cd;
}
#define cerr cerrDummy
#endif
#define REACH cerr<<"reached"<<endl
#define DMP(x) cerr<<#x<<":"<<x<<endl
#define ZERO(x) memset(x,0,sizeof(x))
#define ONE(x) memset(x,-1,sizeof(x))

using pi=pair<int,int>;
using vi=vector<int>;
using ld=long double;

template<class T,class U>
ostream& operator<<(ostream& os,const pair<T,U>& p){
	os<<"("<<p.first<<","<<p.second<<")";
	return os;
}

template<class T>
ostream& operator <<(ostream& os,const vector<T>& v){
	os<<"{";
	REP(i,(int)v.size()){
		if(i)os<<",";
		os<<v[i];
	}
	os<<"}";
	return os;
}

ll read(){
	ll i;
	scanf("%"  SCNd64,&i);
	return i;
}

void printSpace(){
	printf(" ");
}

void printEoln(){
	printf("\n");
}

void print(ll x,int suc=1){
	printf("%" PRId64,x);
	if(suc==1)
		printEoln();
	if(suc==2)
		printSpace();
}

string readString(){
	static char buf[3341000];
	scanf("%s",buf);
	return string(buf);
}

char* readCharArray(){
	static char buf[3341000];
	static int bufUsed=0;
	char* ret=buf+bufUsed;
	scanf("%s",ret);
	bufUsed+=strlen(ret)+1;
	return ret;
}

template<class T,class U>
void chmax(T& a,U b){
	if(a<b)
		a=b;
}

template<class T,class U>
void chmin(T& a,U b){
	if(b<a)
		a=b;
}

template<class T>
T Sq(const T& t){
	return t*t;
}

#define CAPITAL
void Yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<endl;
	#else
	cout<<"Yes"<<endl;
	#endif
	if(ex)exit(0);
}
void No(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<endl;
	#else
	cout<<"No"<<endl;
	#endif
	if(ex)exit(0);
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

const int mod=998244353;
template<class T,class U>
void add(T& a,U b){
	//a=((ll)a+b)%mod;
	a+=b;
	if(a>=mod)a-=mod;
}

template<class T,class U>
void sub(T& a,U b){
	//a=((ll)a-b%mod+mod)%mod;
	a-=b;
	if(a<0)a+=mod;
}

template<class T,class U>
void mult(T& a,U b){
	a=((ll)a*b)%mod;
}

ll modPow(ll a,ll p){
	ll s=1;
	while(p){
		if(p&1)mult(s,a);
		mult(a,a);
		p>>=1;
	}
	return s;
}

ll modInv(ll a){
	return modPow(a,mod-2);
}

const int Vmax=1000010;
int fact[Vmax],factInv[Vmax],invs[Vmax];
void InitFact(){
	fact[0]=1;
	FOR(i,1,Vmax){
		fact[i]=fact[i-1];
		mult(fact[i],i);
	}
	factInv[Vmax-1]=modInv(fact[Vmax-1]);
	for(int i=Vmax-2;i>=0;i--){
		factInv[i]=factInv[i+1];
		mult(factInv[i],i+1);
	}
	for(int i=Vmax-1;i>=1;i--){
		invs[i]=factInv[i];
		mult(invs[i],fact[i-1]);
	}
}
int Choose(int n,int k){
	return ll(fact[n])*factInv[n-k]%mod*factInv[k]%mod;
}
int Binom(int a,int b){
	return ll(fact[a+b])*factInv[a]%mod*factInv[b]%mod;
}

void Impossible(){
	print(0);
	exit(0);
}

const int Nmax=100010;
int n;
map<int,int> waf[Nmax];
int Get(int i,int j){
	if(i<0||n<=i)
		return 0;
	if(j<0||n<=j)
		return 0;
	if(waf[i].count(j))
		return waf[i][j];
	else
		return -1;
}

signed main(){
	n=read();
	int m=read();
	int f=(n-3)*(n-2)/2;
	REP(_,m){
		int a=read()-1,b=read()-1,c=read();
		waf[a][b]=c;
		if(abs(a-b)>=3){
			int g=Get(b,a);
			if(g==-1){
				f--;
			}else if(g!=c){
				Impossible();
			}
		}
	}
	cerr<<endl;
	int dp[2]{};
	{
		int g=Get(0,0);
		if(g==-1){
			dp[0]=1;
			dp[1]=1;
		}else{
			dp[g]=1;
		}
	}
	FOR(i,1,n){
		int nx[2]{};
		pi pos[5]{
			pi(i-2,i),
			pi(i-1,i),
			pi(i,i),
			pi(i,i-1),
			pi(i,i-2)
		};
		int def[5];
		REP(k,5)
			def[k]=Get(pos[k].first,pos[k].second);
		REP(bit,32){
			int val[5]{};
			REP(k,5)
				val[k]=((bit>>k)&1);
			bool ok=true;
			REP(k,5)
				if(def[k]!=-1&&val[k]!=def[k])
					ok=false;
			if(!ok)continue;
			int z=val[1]^val[2]^val[3];
			int accum=0;
			REP(k,5)
				accum^=val[k];
			if(i==1||accum==0){
				add(nx[val[2]],dp[z]);
			}
		}
		dp[0]=nx[0];
		dp[1]=nx[1];
	//	cerr<<i<<" "<<dp[0]<<" "<<dp[1]<<endl;
	}
	int ans=dp[0];
	add(ans,dp[1]);
	mult(ans,modPow(2,f));
	print(ans);
}


Measured memory_bytes: 9472