#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<int> vi;

#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i<=(int)(x);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RREPS(i,x) for(int i=((int)(x));i>0;i--)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)
#define ALL(container) (container).begin(), (container).end()
#define RALL(container) (container).rbegin(), (container).rend()
#define SZ(container) ((int)container.size())
#define mp(a,b) make_pair(a, b)
#define pb push_back
#define eb emplace_back
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define __builtin_popcount __builtin_popcountll

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
    os<<"["; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"]"; return os;
}
template<class T> ostream& operator<<(ostream &os, const set<T> &t) {
    os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os;
}
template<class S, class T> ostream& operator<<(ostream &os, const map<S, T> &t) {
    os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os;
}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first+t.first, s.second+t.second);}
template<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first-t.first, s.second-t.second);}

const int INF = 1<<28;
const double EPS = 1e-8;
const int MOD = 998244353;

long long modpow(long long x, long long y){
    long long r = 1, a = x % MOD;
    while(y > 0){
        if((y&1) == 1) r = (r*a) % MOD;
        a = (a*a) % MOD;
        y /= 2;
    }
    return r;
}

ll T, n, m;

int main(int argc, char *argv[]){
    ios::sync_with_stdio(false);
    while(cin >> n >> m) {
        map<pii, int> p;
        map<pii, int> q;
        for(int i = 0; i < m; i ++) {
            int x, y, c;
            cin >> x >> y >> c; x--; y--;
            if (abs(x - y) >= 3) {
                if (p.count(pii(y, x))) {
                    if (p[pii(y, x)] + c == 1) {
                        cout << 0 << endl;
                        return 0;
                    }
                } else {
                    p.emplace(pii(x, y), c);
                }
            } else {
                q.emplace(pii(x, y), c ? 1 : -1);
            }
        }
        long long ans = 1;
        long long outsize = n * n - n - 2 * (n - 1) - 2 * (n - 2);
        ans *= modpow(2, outsize / 2 - p.size());
        vector<long long> dp1(2);
        dp1[0] = dp1[1] = 1;
        REP(i, n - 1) {
            vector<long long> dp2(2);
            REP(prv, 2) {
                REP(nxt, 2) {
                    if (q[pii(i, i)] && (q[pii(i, i)] == 1) != prv) continue;
                    if (q[pii(i + 1, i + 1)] && (q[pii(i + 1, i + 1)] == 1) != nxt) continue;
                    ll sum = prv + (q[pii(i + 1, i)] == 1) + (q[pii(i, i + 1)] == 1) + nxt;
                    ll unk = (q[pii(i + 1, i)] == 0) + (q[pii(i, i + 1)] == 0);
                    if (sum % 2 && !unk) continue;
                    ll res = (unk == 2) ? 2 : 1;
                    if (i + 2 < n) {
                        ll sum = nxt + (q[pii(i + 2, i)] == 1) + (q[pii(i, i + 2)] == 1);
                        ll unk = (q[pii(i + 2, i)] == 0) + (q[pii(i, i + 2)] == 0);
                        if (sum % 2 && !unk) res = 0;
                        else if(unk == 2) res *= 2;
                    }
                    dp2[nxt] = (dp2[nxt] + dp1[prv] * res) % MOD;
                }
            }
            swap(dp1, dp2);
        }
        cout << ans * (dp1[0] + dp1[1]) % MOD << endl;
    }
    return 0;
}


Measured memory_bytes: 34688