#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}


template<typename T,T MOD = 1000000007>
struct Mint{
  T v;
  Mint():v(0){}
  Mint(signed v):v(v){}
  Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}

  Mint pow(long long k){
    Mint res(1),tmp(v);
    while(k){
      if(k&1) res*=tmp;
      tmp*=tmp;
      k>>=1;
    }
    return res;
  }
  
  Mint inv(){return pow(MOD-2);}
  
  Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}
  Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}
  Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}
  Mint& operator/=(Mint a){return (*this)*=a.inv();}
  
  Mint operator+(Mint a) const{return Mint(v)+=a;};
  Mint operator-(Mint a) const{return Mint(v)-=a;};
  Mint operator*(Mint a) const{return Mint(v)*=a;};
  Mint operator/(Mint a) const{return Mint(v)/=a;};

  Mint operator-(){return v?MOD-v:v;}

  bool operator==(const Mint a)const{return v==a.v;}
  bool operator!=(const Mint a)const{return v!=a.v;}
  bool operator <(const Mint a)const{return v <a.v;}

  // find x s.t. a^x = b
  static T log(Mint a,Mint b){
    const T sq=40000;
    unordered_map<T, T> dp;
    dp.reserve(sq);
    Mint res(1);
    for(Int r=0;r<sq;r++){
      if(!dp.count(res)) dp[res]=r;
      res*=a;
    }
    Mint p=pow(a.inv(),sq);
    res=b;
    for(Int q=0;q<=MOD/sq+1;q++){
      if(dp.count(res)){
        T idx=q*sq+dp[res];
        if(idx>0) return idx;
      }
      res*=p;
    }    
    return T(-1);
  }

  static vector<Mint> fact,finv,invs;
  
  static void init(Int n){
    if(n+1<=(signed)fact.size()) return;
    fact.assign(n+1,1);
    finv.assign(n+1,1);
    invs.assign(n+1,1);
    
    for(Int i=1;i<=n;i++) fact[i]=fact[i-1]*Mint(i);
    finv[n]=Mint(1)/fact[n];
    for(Int i=n;i>=1;i--) finv[i-1]=finv[i]*Mint(i);
    for(Int i=1;i<=n;i++) invs[i]=finv[i]*fact[i-1];
  }

  static Mint comb(long long n,Int k){
    Mint res(1);
    for(Int i=0;i<k;i++){
      res*=Mint(n-i);
      res/=Mint(i+1);
    }
    return res;
  }
  
  static Mint C(Int n,Int k){
    if(n<k||k<0) return Mint(0);
    init(n);
    return fact[n]*finv[n-k]*finv[k];
  }

  static Mint P(Int n,Int k){
    if(n<k||k<0) return Mint(0);
    init(n);
    return fact[n]*finv[n-k];
  }
  
  static Mint H(Int n,Int k){
    if(n<0||k<0) return Mint(0);
    if(!n&&!k) return Mint(1);
    init(n+k-1);
    return C(n+k-1,k);
  }

  static Mint S(Int n,Int k){
    Mint res;
    init(k);
    for(Int i=1;i<=k;i++){
      Mint tmp=C(k,i)*Mint(i).pow(n);
      if((k-i)&1) res-=tmp;
      else res+=tmp;
    }    
    return res*=finv[k];
  }

  static vector<vector<Mint> > D(Int n,Int m){
    vector<vector<Mint> > dp(n+1,vector<Mint>(m+1,0));
    dp[0][0]=Mint(1);
    for(Int i=0;i<=n;i++){
      for(Int j=1;j<=m;j++){
        if(i-j>=0) dp[i][j]=dp[i][j-1]+dp[i-j][j];
        else dp[i][j]=dp[i][j-1];
      }
    }
    return dp;
  }

  static Mint B(Int n,Int k){
    Mint res;
    for(Int j=1;j<=k;j++) res+=S(n,j);
    return res;
  }

  static Mint montmort(Int n){
    Mint res;
    init(n);
    for(Int k=2;k<=n;k++){
      if(k&1) res-=finv[k];
      else res+=finv[k];
    }
    return res*=fact[n];
  }

  static Mint LagrangePolynomial(vector<Mint> &y,Mint t){
    Int n=y.size()-1;    
    if(t.v<=n) return y[t.v];
    init(n+1);
    Mint num(1);
    for(Int i=0;i<=n;i++) num*=t-Mint(i);
    Mint res;
    for(Int i=0;i<=n;i++){
      Mint tmp=y[i]*num/(t-Mint(i))*finv[i]*finv[n-i];
      if((n-i)&1) res-=tmp;
      else res+=tmp;
    }
    return res;
  }
};
template<typename T,T MOD>
vector<Mint<T, MOD> > Mint<T, MOD>::fact = vector<Mint<T, MOD> >();
template<typename T,T MOD>
vector<Mint<T, MOD> > Mint<T, MOD>::finv = vector<Mint<T, MOD> >();
template<typename T,T MOD>
vector<Mint<T, MOD> > Mint<T, MOD>::invs = vector<Mint<T, MOD> >();


template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}

template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

//INSERT ABOVE HERE
signed main(){
  using M = Mint<Int, 998244353>;
  Int n,m;
  cin>>n>>m;
  vector<Int> a(m),b(m),c(m);
  for(Int i=0;i<m;i++) cin>>a[i]>>b[i]>>c[i];
  for(Int i=0;i<m;i++) a[i]--,b[i]--;
  
  using P = pair<Int, Int>;
  map<P, Int> ps;
  for(Int i=0;i<m;i++) ps[P(a[i],b[i])]=c[i];


  Int cnt=(n*n-n)/2;
  vector<Int> d(n,-1);
  
  vector<Int> px1(n,-1),px2(n,-1),py1(n,-1),py2(n,-1);
  
  for(Int i=0;i<m;i++){
    if(a[i]==b[i]) d[a[i]]=c[i];
    if(!ps.count(P(b[i],a[i]))||a[i]<b[i]) cnt--;    

    if(a[i]==b[i]+1) px1[a[i]]=c[i];
    if(a[i]==b[i]+2) px2[a[i]]=c[i];
    if(a[i]+1==b[i]) py1[b[i]]=c[i];
    if(a[i]+2==b[i]) py2[b[i]]=c[i];    
    
    if(abs(a[i]-b[i])<=2) continue;
    if(ps.count(P(b[i],a[i]))){
      if(c[i]!=ps[P(b[i],a[i])]){
        cout<<0<<endl;
        return 0;
      }
    }
  }
  
  auto dp=make_v<M>(2,2,n+1);
  
  dp[0][0][0]=M(1);
  for(Int i=0;i<n;i++){
    for(Int x=0;x<2;x++){
      for(Int y=0;y<2;y++){
        for(Int z=0;z<2;z++){
          if(~d[i]&&d[i]!=z) continue;
          Int flg=1;
          if(~px1[i]&&~py1[i]){
            if(y==z) flg&=px1[i]==py1[i];
            if(y!=z) flg&=px1[i]!=py1[i];
          }          
          if(~px2[i]&&~py2[i]){
            if(y==1) flg&=px2[i]!=py2[i];
            if(y!=1) flg&=px2[i]==py2[i];
          }          
          if(flg) dp[y][z][i+1]+=dp[x][y][i];
        }
      }      
    }
  }
  M ans=dp[0][0][n]+dp[0][1][n]+dp[1][0][n]+dp[1][1][n];
  ans*=M(2).pow(cnt);
  cout<<ans.v<<endl;
  return 0;
}


Measured memory_bytes: 13168