#include<bits/stdc++.h>
//ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//clock_t start=clock();clock_t end=clock();cout<<(double)(end-start)/CLOCKS_PER_SEC<<endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef pair<pii,pii> P;
typedef tuple<ll,ll,ll> tl;
typedef pair<double,double> pdd;
typedef vector<vector<ll>> mat;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll mod5=1000000009;
ll inf=1LL<<62;
double pi=3.141592653589793238462643383279L;
double eps=1e-14;
#define rep(i,m,n) for(ll i=m;i<n;i++)
#define rrep(i,n,m) for(ll i=n;i>=m;i--)
#define srep(itr,st) for(auto itr=st.begin();itr!=st.end();itr++)
#define mrep(itr,mp) for(auto& itr:mp)
#define Max(a,b) a=max(a,b)
#define Min(a,b) a=min(a,b)
int dh[4]={1,-1,0,0};
int dw[4]={0,0,1,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
#define umh unordered_map<ll,ll,custom_hash>
ll gcd(ll a,ll b){
    if(a<b)swap(a,b);
    if(b==0)return a;
    if(a%b==0)return b;
    return gcd(b,a%b);
}
ll lcm(ll a,ll b){
    ll c=gcd(a,b);
    return a*b/c;
}
ll Pow(ll n,ll k){
    ll ret=1;
    ll now=n;
    while(k>0){
        if(k&1)ret*=now;
        now*=now;
        k/=2;
    }
    return ret;
}
ll beki(ll n,ll k,ll md){
  ll ret=1;
  ll now=n;
    now%=md;
  while(k>0){
    if(k%2==1){
      ret*=now;
      ret%=md;
    }
    now*=now;
    now%=md;
    k/=2;
  }
  return ret;
}
ll gyaku(ll n,ll md){
  return beki(n,md-2,md);
}
ll popcount(ll n){
    ll ret=0;
    ll u=n;
    while(u>0){
        ret+=u%2;
        u/=2;
        
    }
    return ret;
}


int main(){
    ios::sync_with_stdio(false);cin.tie(0);
    int n,m;cin>>n>>m;
    map<pii,int> mp;
    ll cnt=0;
    rep(i,3,n){
        cnt+=i-3+1;
    }
    rep(i,0,m){
        int a,b,c;cin>>a>>b>>c;
        a--;
        b--;
        mp[{a,b}]=c;
        if(abs(a-b)>=3){
            if(mp.count({b,a})){
                if(mp[{b,a}]!=c){
                    cout<<0<<endl;
                    return 0;
                }
            }
            else{
                cnt--;
            }
        }
    }
    ll ans=beki(2,cnt,mod2);
    ll dp[n][2];
    memset(dp,0,sizeof dp);
    rep(i,0,16){
        if(popcount(i)%2)continue;
        int a[4];
        rep(j,0,4){
            a[j]=(i>>j)&1;
        }
        if(mp.count({1,1})&&mp[{1,1}]!=a[0])continue;
        if(mp.count({1,0})&&mp[{1,0}]!=a[1])continue;
        if(mp.count({0,1})&&mp[{0,1}]!=a[2])continue;
        if(mp.count({0,0})&&mp[{0,0}]!=a[3])continue;
        dp[1][a[0]]++;
    }
    int fh[5]={0,0,-1,0,-2};
    int fw[5]={0,-1,0,-2,0};
    int nh=1,nw=1;
    int a[5];
    rep(i,2,n){
        nh++;
        nw++;
        rep(j,0,32){
            bool ng=false;
            rep(k,0,5){
                a[k]=(j>>k)&1;
                int nnh=nh+fh[k],nnw=nw+fw[k];
                if(mp.count({nnh,nnw})&&mp[{nnh,nnw}]!=a[k]){
                    ng=true;
                    break;
                }
            }
            if(ng)continue;
            if(a[1]==a[2]){
                if(a[3]==a[4]){
                    if(a[0]==0)(dp[i][0]+=dp[i-1][0])%=mod2;
                }
                else{
                    if(a[0]==1)(dp[i][1]+=dp[i-1][1])%=mod2;
                }
            }
            else{
                if(a[3]==a[4]){
                    if(a[0]==1)(dp[i][1]+=dp[i-1][0])%=mod2;
                }
                else{
                    if(a[0]==0)(dp[i][0]+=dp[i-1][1])%=mod2;
                }
            }
        }
    }
    (ans*=dp[n-1][0]+dp[n-1][1])%=mod2;
    cout<<ans<<endl;
}


Measured memory_bytes: 4992