#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// using i128 = boost::multiprecision::int128_t;
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using Vbo = vector<bool>;
using VV = vector<V>;
using VVll = vector<Vll>;
using VVld = vector<Vld>;
using VVbo = vector<Vbo>;
using VVV = vector<VV>;
using VVVll = vector<VVll>;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
using Pld = pair<ld, ld>;
#define rep2(i, m, n) for(int i=int(m); i<int(n); ++i)
#define drep2(i, m, n) for(int i=int(m)-1; i>=int(n); --i)
#define rep(i, n) rep2(i, 0, n)
#define drep(i, n) drep2(i, n, 0)
#define all(a) a.begin(), a.end()
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
template<typename T> inline int sz(T &x) { return x.size(); }
template<typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }
template<typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { os << '(' << p.first << ", " << p.second << ')'; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v) { for (auto &e : v) is >> e; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<typename T> inline int count_between(vector<T> &a, T l, T r) { return lower_bound(all(a), r) - lower_bound(all(a), l); } // [l, r)
inline int fLog2(const int x) { return 31-__builtin_clz(x); } // floor(log2(x))
inline int fLog2(const ll x) { return 63-__builtin_clzll(x); }
inline int cLog2(const int x) { return (x == 1) ? 0 : 32-__builtin_clz(x-1); } // ceil(log2(x))
inline int cLog2(const ll x) { return (x == 1) ? 0 : 64-__builtin_clzll(x-1); }
inline int popcount(const int x) { return __builtin_popcount(x); }
inline int popcount(const ll x) { return __builtin_popcountll(x); }
const int INF  = 1<<30;
const ll INFll = 1ll<<62;
const ld EPS   = 1e-10;
const ld PI    = acos(-1.0);
// const int MOD  = int(1e9)+7;
const int MOD  = 998244353;


struct mint {
  ll x;
  mint(ll x=0) : x((x%MOD+MOD)%MOD) {}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) { if ((x += a.x) >= MOD) x -= MOD; return *this; }
  mint& operator-=(const mint a) { if ((x -= a.x) < 0) x += MOD; return *this; }
  mint& operator*=(const mint a) { (x *= a.x) %= MOD; return *this; }
  mint operator+(const mint a) const { return mint(*this) += a; }
  mint operator-(const mint a) const { return mint(*this) -= a; }
  mint operator*(const mint a) const { return mint(*this) *= a; }
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
  mint& operator/=(const mint r) {
    ll a = r.x, b = MOD, u = 1, v = 0;
    while (b) {
      ll t = a / b;
      a -= t * b; swap(a, b);
      u -= t * v; swap(u, v);
    }
    x = x * u % MOD;
    if (x < 0) x += MOD;
    return *this;
  }
  mint operator/(const mint a) const { return mint(*this) /= a; }
};
// istream& operator>>(istream& is, mint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }
using Vm = vector<mint>;
using VVm = vector<Vm>;
using VVVm = vector<VVm>;


int main() {
  ll n, m; cin >> n >> m;
  map<P, int> c;
  set<P> S;
  rep(i, m) {
    int x, y, z; cin >> x >> y >> z;
    --x, --y;
    c[{x, y}] = 2-z;
    if (abs(x-y) > 2) S.emplace(x, y);
  }

  Vm dp(2);
  dp[0] = 1;
  dp[1] = 1;
  if (c[{0, 0}] == 1) dp[0] = 0;
  if (c[{0, 0}] == 2) dp[1] = 0;

  rep(i, n-1) {
    Vm _dp(2);
    rep(j, 2) rep(k, 2) {
      mint co = 1;
      
      int cnt = 0;
      int x = 0;
      int y = 0;
      if (c.find({i, i+1}) != c.end()) x = c[{i, i+1}], ++cnt;
      if (c.find({i+1, i}) != c.end()) y = c[{i+1, i}], ++cnt;
      if (cnt == 0) co *= 2;
      if (cnt == 2 && ((x+y+j+k)&1)) co = 0;

      if (i < n-2) {
        int cnt = 0;
        int x = 0;
        int y = 0;
        if (c.find({i, i+2}) != c.end()) x = c[{i, i+2}], ++cnt;
        if (c.find({i+2, i}) != c.end()) y = c[{i+2, i}], ++cnt;
        if (cnt == 0) co *= 2;
        if (cnt == 2 && ((x+y+k)&1)) co = 0;
      }
      _dp[k] += dp[j] * co;
    }
    swap(dp, _dp);
    if (c.find({i+1, i+1}) != c.end() && c[{i+1, i+1}] == 1) dp[0] = 0;
    if (c.find({i+1, i+1}) != c.end() && c[{i+1, i+1}] == 2) dp[1] = 0;
  }
  mint ans = dp[0] + dp[1];

  ll cnt = (n-2)*(n-3);
  for (auto &e : S) {
    auto [i, j] = e;
    int x = 0;
    int y = 0;
    if (c.find({i, j}) != c.end()) x = c[{i, j}];
    if (c.find({j, i}) != c.end()) y = c[{j, i}];
    if (y && ((x+y)&1)) {
      cout << 0 << '\n';
      return 0;
    }
    if (y) --cnt;
    else cnt -= 2;
  }
  cnt /= 2;
  ans *= mint(2).pow(cnt);
  cout << ans << '\n';
  return 0;
}


Measured memory_bytes: 9080