#include <bits/stdc++.h>

using namespace std;

constexpr int N = 1e5;

vector<int> nei[2][N];

bool con(int t, int v, int u) { return !!count(nei[t][v].begin(), nei[t][v].end(), u); }

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n, m; cin >> n >> m;
  for (int i = 0; i < m; ++i) {
    int a, b, c; cin >> a >> b >> c; --a, --b;
    nei[c][a].push_back(b);
    nei[c][b].push_back(a);
  }
  uint64_t ans[5]{};
  for (int i = 0; i < n; ++i)
  for (auto v: nei[0][i])
  for (auto u: nei[1][i]) if (ans[2] += v == u, ans[3] += con(0, v, u) && con(1, v, u), con(0, v, u) && i < v)
  for (auto w: nei[0][i]) ans[4] += con(1, v, w) && con(1, u, w);
  cout << (n + ans[2] / 2 + ans[3] + ans[4]) % 998244353;
}