#include<map>
#include<map>
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
using namespace std;

typedef long long LL;
typedef vector<int> VI;

#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(),i##_end=(c).end();i!=i##_end;++i)
#define eprintf(...) fprintf(stderr, __VA_ARGS__)

template<class T> inline void amin(T &x, const T &y) { if (y<x) x=y; }
template<class T> inline void amax(T &x, const T &y) { if (x<y) x=y; }
template<class Iter> void rprintf(const char *fmt, Iter begin, Iter end) {
    for (bool sp=0; begin!=end; ++begin) { if (sp) putchar(' '); else sp = true; printf(fmt, *begin); }
    putchar('\n');
}

template<unsigned MOD> struct ModInt {
    static const unsigned static_MOD = MOD;
    unsigned x;
    void undef() { x = (unsigned)-1; }
    bool isnan() const { return x == (unsigned)-1; }
    inline int geti() const { return (int)x; }
    ModInt() { x = 0; }
    ModInt(const ModInt &y) { x = y.x; }
    ModInt(int y) { if (y<0 || (int)MOD<=y) y %= (int)MOD; if (y<0) y += MOD; x=y; }
    ModInt(unsigned y) { if (MOD<=y) x = y % MOD; else x = y; }
    ModInt(long long y) { if (y<0 || MOD<=y) y %= MOD; if (y<0) y += MOD; x=y; }
    ModInt(unsigned long long y) { if (MOD<=y) x = y % MOD; else x = y; }
    ModInt &operator+=(const ModInt y) { if ((x += y.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(const ModInt y) { if ((x -= y.x) & (1u<<31)) x += MOD; return *this; }
    ModInt &operator*=(const ModInt y) { x = (unsigned long long)x * y.x % MOD; return *this; }
    ModInt &operator/=(const ModInt y) { x = (unsigned long long)x * y.inv().x % MOD; return *this; }
    ModInt operator-() const { return (x ? MOD-x: 0); }

    ModInt inv() const {
	unsigned a = MOD, b = x; int u = 0, v = 1;
	while (b) {
	    int t = a / b;
	    a -= t * b; swap(a, b);
	    u -= t * v; swap(u, v);
	}
	if (u < 0) u += MOD;
	return ModInt(u);
    }
    ModInt pow(long long y) const {
	ModInt b = *this, r = 1;
	if (y < 0) { b = b.inv(); y = -y; }
	for (; y; y>>=1) {
	    if (y&1) r *= b;
	    b *= b;
	}
	return r;
    }
    friend ModInt operator+(ModInt x, const ModInt y) { return x += y; }
    friend ModInt operator-(ModInt x, const ModInt y) { return x -= y; }
    friend ModInt operator*(ModInt x, const ModInt y) { return x *= y; }
    friend ModInt operator/(ModInt x, const ModInt y) { return x *= y.inv(); }
    friend bool operator<(const ModInt x, const ModInt y) { return x.x < y.x; }
    friend bool operator==(const ModInt x, const ModInt y) { return x.x == y.x; }
    friend bool operator!=(const ModInt x, const ModInt y) { return x.x != y.x; }
};

const LL MOD =998244353 ;
typedef ModInt<MOD> Mint;
int N, M;

map<int, bool> D;
VI one[100011], two[100011];
map<pair<int, int>, bool> cell;

Mint dp[100011][2];
LL minu;
bool ok() {
    int cnt = 0;
    EACH (e, cell) if (e->first.first < e->first.second) {
	pair<int, int> key(e->first.second, e->first.first);
	auto it = cell.find(key);
	if (it != cell.end()) {
	    cnt++;
	    if (it->second != e->second) {
		return false;
	    }
	}
    }

    minu = (int)cell.size() - cnt;
    return true;
}

void MAIN() {
    scanf("%d%d", &N, &M);

    REP (i, M) {
	int a, b, c;
	scanf("%d%d%d", &a, &b, &c);
	if (a == b) {
	    D[a] = c;
	} else if (abs(a - b) == 1) {
	    one[max(a, b)].push_back(c);
	} else if (abs(a - b) == 2) {
	    two[max(a, b)].push_back(c);
	} else {
	    cell[make_pair(a, b)] = c;
	}
    }


    if (ok()) {
	if (D.find(1) != D.end()) {
	    dp[1][D[1]] = 1;
	} else {
	    dp[1][0] = dp[1][1] = 1;
	}

	for (int i=2; i<=N; i++) {
	    auto it = D.find(i);
	    REP (my, 2) {
		if (it != D.end() && it->second != my) continue;

		if (two[i+1].size() == 2u && (two[i+1][0] + two[i+1][1] + my) % 2 != 0) continue;

		REP (pre, 2) if (dp[i-1][pre].x) {
		    if (one[i].size() == 2u && (one[i][0] + one[i][1] + my + pre) % 2 != 0) continue;

		    Mint c = 1;
		    if (one[i].empty()) c += c;
		    if (i+1 <= N && two[i+1].empty()) c += c;
		    dp[i][my] += dp[i-1][pre] * c;
		}
	    }
	}

	Mint ans = dp[N][0] + dp[N][1];

	if (N > 3) {
	    LL x = (LL)(N-3)*(N-2)/2 - minu;
	    ans *= Mint(2).pow(x);
	}
	
	printf("%d\n", ans.geti());
    } else {
	puts("0");
    }
}

int main() {
    int TC = 1;
//    scanf("%d", &TC);
    REP (tc, TC) MAIN();
    return 0;
}



Measured memory_bytes: 8832