#include <bits/stdc++.h>

//    #include <boost/multiprecision/cpp_int.hpp>
 #define int long long
 #define inf  1000000007
 #define pa pair<int,int>
 #define ll long long
 #define pal pair<double,double>
 #define ppap pair<pa,int>
  #define PI 3.14159265358979323846
  #define paa pair<int,char>
  #define  mp make_pair
  #define  pb push_back
  #define EPS (1e-10)
                                          
    int dx[8]={0,1,0,-1,1,1,-1,-1};
    int dy[8]={1,0,-1,0,-1,1,1,-1};
                                            using namespace std;
                                   			class pa3{
                                            	public:
                                            	int x,y,z;
                                            	pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}
                                            	bool operator < (const pa3 &p) const{
                                            		if(x!=p.x) return x<p.x;
                                            		if(y!=p.y) return y<p.y;
                                            		 return z<p.z;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                   				bool operator > (const pa3 &p) const{
                                            		if(x!=p.x) return x>p.x;
                                            		if(y!=p.y) return y>p.y;
                                            		 return z>p.z;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa3 &p) const{
                                            		return x==p.x && y==p.y && z==p.z;
                                            	}
                                            		bool operator != (const pa3 &p) const{
                                            			return !( x==p.x && y==p.y && z==p.z);
                                            	}
                                            
                                            };
                                            
                                            class pa4{
                                            	public:
                                            	int x;
                                            	int y,z,w;
                                            	pa4(int x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}
                                            	bool operator < (const pa4 &p) const{
                                            		if(x!=p.x) return x<p.x;
                                            		if(y!=p.y) return y<p.y;
                                            		if(z!=p.z)return z<p.z;
                                            		return w<p.w;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator > (const pa4 &p) const{
                                            		if(x!=p.x) return x>p.x;
                                            		if(y!=p.y) return y>p.y;
                                            		if(z!=p.z)return z>p.z;
                                            		return w>p.w;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa4 &p) const{
                                            		return x==p.x && y==p.y && z==p.z &&w==p.w;
                                            	}
                                            		
                                            
                                            };
                                            class pa2{
                                            	public:
                                            	int x,y;
                                            	pa2(int x=0,int y=0):x(x),y(y) {}
                                            	pa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}
                                            	pa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}
                                            	bool operator < (const pa2 &p) const{
                                            		return y != p.y ? y<p.y: x<p.x;
                                            	}
                                            	bool operator > (const pa2 &p) const{
                                            		return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa2 &p) const{
                                            		return abs(x-p.x)==0 && abs(y-p.y)==0;
                                            	}
                                            	bool operator != (const pa2 &p) const{
                                            		return !(abs(x-p.x)==0 && abs(y-p.y)==0);
                                            	}
                                            		
                                            
                                            };
                                            
/*
                                            class Point{
                                            	public:
                                            	double x,y;
                                            	Point(double x=0,double y=0):x(x),y(y) {}
                                            	Point operator + (Point p) {return Point(x+p.x,y+p.y);}
                                            	Point operator - (Point p) {return Point(x-p.x,y-p.y);}
                                            	Point operator * (double a) {return Point(x*a,y*a);}
                                            	Point operator / (double a) {return Point(x/a,y/a);}
                                            	double absv() {return sqrt(norm());}
                                            	double norm() {return x*x+y*y;}
                                            	bool operator < (const Point &p) const{
                                            		return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const Point &p) const{
                                            		return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
                                            	}
                                            };
                                            typedef Point Vector;
                                     #define pl pair<int,pas>
                                            struct Segment{
                                            Point p1,p2;
                                            };
                                             double dot(Vector a,Vector b){
                                            	return a.x*b.x+a.y*b.y;
                                            }
                                            double cross(Vector a,Vector b){
                                            	return a.x*b.y-a.y*b.x;
                                            }
                                        
                bool parareru(Point a,Point b,Point c,Point d){
                //	if(abs(cross(a-b,d-c))<EPS)cout<<"dd "<<cross(a-b,d-c)<<endl;
                	return abs(cross(a-b,d-c))<EPS;
                }
                double distance_ls_p(Point a, Point b, Point c) {
                  if ( dot(b-a, c-a) < EPS ) return (c-a).absv();
                  if ( dot(a-b, c-b) < EPS ) return (c-b).absv();
                  return abs(cross(b-a, c-a)) / (b-a).absv();
                }
                bool is_intersected_ls(Segment a,Segment b) {
                	if(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return false;
                	if(parareru((a.p2),(a.p1),(a.p1),(b.p2))&&parareru((a.p2),(a.p1),(a.p1),(b.p1))){
                //		cout<<"sss"<<endl;
                		if(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true;
                		if(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true;
                		if(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true;
                		if(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true;
                		return false;
                	}
                  else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1, a.p2-b.p1) < EPS );
                }
                 
                double segment_dis(Segment a,Segment b){
                	if(is_intersected_ls(a,b))return 0;
                	double r=distance_ls_p(a.p1, a.p2, b.p1);
                	r=min(r,distance_ls_p(a.p1, a.p2, b.p2));
                	r=min(r,distance_ls_p(b.p1, b.p2, a.p2));
                	r=min(r,distance_ls_p(b.p1, b.p2, a.p1));
                	return r;
                }
                Point intersection_ls(Segment a, Segment b) {
                  Point ba = b.p2-b.p1;
                  double d1 = abs(cross(ba, a.p1-b.p1));
                  double d2 = abs(cross(ba, a.p2-b.p1));
                  double t = d1 / (d1 + d2);
                 
                  return a.p1 + (a.p2-a.p1) * t;
                }
 */                
                                string itos( int i ) {
                                ostringstream s ;
                                s << i ;
                                return s.str() ;
                                }
                                 
                                int gcd(int v,int b){
                                	if(v>b) return gcd(b,v);
                                	if(v==b) return b;
                                	if(b%v==0) return v;
                                	return gcd(v,b%v);
                                }
                 
                                double distans(double x1,double y1,double x2,double y2){
                                	double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
                                	return sqrt(rr);
                                	
                                }
                                int mod;
int extgcd(int a, int b, int &x, int &y) {
    if (b == 0) {
        x = 1;
        y = 0;
        return a;
    }
    int d = extgcd(b, a%b, y, x);
    y -= a/b * x;
    return d;
}
    
                                
                int pr[1000010];
                int inv[1000010];
                
                int beki(int wa,int rr,int warukazu){
                	if(rr==0) return 1%warukazu;
                	if(rr==1) return wa%warukazu;
                	wa%=warukazu;
                	if(rr%2==1) return ((ll)beki(wa,rr-1,warukazu)*(ll)wa)%warukazu;
                	ll zx=beki(wa,rr/2,warukazu);
                	return (zx*zx)%warukazu;
                }
    double bekid(double w,int r){
    	if(r==0) return 1.0;
    	if(r==1) return w;
    	if(r%2) return bekid(w,r-1)*w;
    	double f=bekid(w,r/2);
    	return f*f;
    }
                
    			int comb(int nn,int rr){
    				int r=pr[nn]*inv[rr];
    				r%=mod;
    				r*=inv[nn-rr];
    				r%=mod;
    				return r;
    			}
                
                void gya(int ert){
                	pr[0]=1;
                	for(int i=1;i<ert;i++){
                		pr[i]=(pr[i-1]*i)%mod;
                	}
                	for(int i=0;i<ert;i++) inv[i]=beki(pr[i],mod-2,mod);
                	
                }
                
              //   cin.tie(0);
    		//	ios::sync_with_stdio(false);
    			//priority_queue<pa3,vector<pa3>,greater<pa3>> pq;            
                 //sort(ve.begin(),ve.end(),greater<int>());
    
                                     //----------------kokomade tenpure------------
int ok[519]={};
vector<pa3> ve[100020];
vector<int> seni[512];

vector<int> dp(512,0);
int memo[4][4];

int yaru(){
	int ans=0;
	int mask1=0b1100110000000000;
	int mask2=0b0000011001100000;
	int mask3=0b0000000000110011;
	int mask4=0b1110111011100000;
	int mask5=0b0000011101110111;
	for(int i=0;i<(1<<16);i++){
		if(__builtin_popcountll(i)%2)continue;
		if(__builtin_popcountll(i&mask1)%2)continue;
		if(__builtin_popcountll(i&mask2)%2)continue;
		if(__builtin_popcountll(i&mask3)%2)continue;
		if(__builtin_popcountll(i&mask4)%2)continue;
		if(__builtin_popcountll(i&mask5)%2)continue;
		ans++;
	}
	return ans;
	
}

 signed main(){

  //  	       cin.tie(0);
  // 			ios::sync_with_stdio(false);


 	
int n,m;
 	cin>>n>>m;
 	memo[1][1]=0;
 	memo[1][2]=1;
 	memo[1][3]=7;
 	memo[2][1]=2;
 	memo[2][2]=3;
 	memo[2][3]=4;
 	memo[3][1]=8;
 	memo[3][2]=5;
 	memo[3][3]=6;
 	
 	if(n==2){
 		int p=0;
 		for(int i=0;i<m;i++){
 			int a,b,c;
 			cin>>a>>b>>c;
 			p+=c;
 		}
 		if(p%2){
 			int ans=0;
 			for(int i=0;i<(1<<(4-m));i++)if(__builtin_popcountll(i)%2)ans++;
 			cout<<ans<<endl;
 		}
 		else{
 			int ans=0;
 			for(int i=0;i<(1<<(4-m));i++)if(__builtin_popcountll(i)%2==0)ans++;
 			cout<<ans<<endl;
 		}
 		return 0;
 	}
 	map<pa,int> ma;
 	for(int i=0;i<m;i++){
 		int a,b,c;
 		cin>>a>>b>>c;
 		ma[{a,b}]=c;
 	}
 	int shu=0;
 	for(auto it=ma.begin();it!=ma.end();it++){
 		int x=it->first.first;
 		int y=it->first.second;
 		
 		if(abs(x-y)<=2){
 				ve[max(x,y)].pb({x,y,it->second});
 		}
 		else{
 				if(ma.count({y,x})){
 					int g=ma[{y,x}];
 					if(g!=it->second){
 						cout<<0<<endl;
 						return 0;
 					}
 					if(x<y)shu++;
 				}
 				else shu++;
 		}
 	}
 	mod=998244353;
 	int amari=(n-3)*(n-2)/2-shu;
 	int ans=beki(2,amari,mod);
 //	cout<<ans<<" "<<shu<<endl;
 	for(int i=0;i<(1<<9);i++){
 		int mask1=0b000001111;
 		int mask2=0b001111000;
 		if(__builtin_popcountll(i)%2) continue;
 		if(__builtin_popcountll(i&mask1)%2) continue;
 		if(__builtin_popcountll(i&mask2)%2) continue;
 		ok[i]=1;
 	}
 	int hr=0;
 	for(int i=0;i<512;i++)if(ok[i]){
 
 		int j=i/8;
 		j&=15;
 		for(int k=j;k<512;k+=16)if(ok[k])seni[i].pb(k);
 		
 		//cout<<bitset<9>(i)<<" "<<seni[i].size()<<endl;
 		hr+=seni[i].size();
 	}
 	
 //	for(auto v:seni[3])cout<<bitset<9>(v)<<endl;
 	for(int i=0;i<512;i++)if(ok[i]){
 		
 		for(int t=1;t<=3;t++){
 			for(auto v:ve[t]){
 				if(v.z==1 && (i&(1<<memo[v.x][v.y]))==0)goto lll;
 				if(v.z==0 && (i&(1<<memo[v.x][v.y]))>0)goto lll;
 				
 			}
 		}
 		dp[i]=1;
 		lll:;
 	}
 	
 	for(int r=4;r<=n;r++){
 		vector<int> dp2(512,0);
 		for(int i=0;i<512;i++)if(dp[i]){
 			for(auto v:seni[i]){
 				dp2[v]+=dp[i];
 				dp2[v]%=mod;
 			}
 		}
 		for(int i=0;i<512;i++)if(dp2[i]){
 			for(auto v:ve[r]){
 				if(v.x==r && v.y==r){
 					if(((i&(1<<6))>0) ^ (v.z==1)) dp2[i]=0;
 				}
 				
 				else if(v.x==r && v.y==r-2){
 					if(((i&(1<<8))>0 )^ (v.z==1)) dp2[i]=0;
 				}
 				else if(v.x==r && v.y==r-1){
 					if(((i&(1<<5))>0 )^ (v.z==1)) dp2[i]=0;
 				}
 				else if(v.x==r-2 && v.y==r){
 					if(((i&(1<<7))>0 )^ (v.z==1)) dp2[i]=0;
 				}
 				else if(v.x==r-1 && v.y==r){
 					if(((i&(1<<4))>0 )^( v.z==1)) dp2[i]=0;
 				}
 				else exit(1);
 				
 			}
 		}
 		swap(dp,dp2);
 	}
 	int wa=0;
 	for(int i=0;i<512;i++){
 		wa+=dp[i];
 		wa%=mod;
 	}
 	cout<<ans*wa%mod<<endl;
 	return 0;
  }


Measured memory_bytes: 9472