#include <bits/stdc++.h>
using namespace std;
const int maxn = 200010, mod = 998244353, inv2 = (mod + 1) / 2;
int T, n, m, num[maxn], tot;
int f[2][maxn], sum[2][maxn], pw[maxn], ipw[maxn];
struct node { int l, r, c; }a[maxn];
struct SegmentTree {
    struct node { int sum, tag; }t[maxn << 2];
    void build(int d, int l, int r) {
      t[d].sum = 0, t[d].tag = 1;
      if(l == r) return;
      int md = l + r >> 1;
      build(d << 1, l, md), build(d << 1 | 1, md + 1, r);
    }
    inline void pushdown(int d) {
      t[d << 1].sum = 1ll * t[d << 1].sum * t[d].tag % mod, t[d << 1 | 1].sum = 1ll * t[d << 1 | 1].sum * t[d].tag % mod;
      t[d << 1].tag = 1ll * t[d << 1].tag * t[d].tag % mod, t[d << 1 | 1].tag = 1ll * t[d << 1 | 1].tag * t[d].tag % mod;
      t[d].tag = 1;
    }
    void modify1(int d, int l, int r, int des, int val) {
      if(l == r) return t[d].sum = val, void();
      if(t[d].tag != 1) pushdown(d);
      int md = l + r >> 1;
      if(des <= md) modify1(d << 1, l, md, des, val);
      else modify1(d << 1 | 1, md + 1, r, des, val);
      t[d].sum = (t[d << 1].sum + t[d << 1 | 1].sum) % mod;
    }
    void modify2(int d, int l, int r, int dl, int dr) {
      if(dl > dr) return;
      if(dl <= l && r <= dr) return t[d].sum = (t[d].sum << 1) % mod, t[d].tag = (t[d].tag << 1) % mod, void();
      if(t[d].tag != 1) pushdown(d);
      int md = l + r >> 1;
      if(dl <= md) modify2(d << 1, l, md, dl, dr);
      if(dr > md) modify2(d << 1 | 1, md + 1, r, dl, dr);
      t[d].sum = (t[d << 1].sum + t[d << 1 | 1].sum) % mod;
    }
    int query(int d, int l, int r, int dl, int dr) {
      if(dl > dr) return 0;
      if(dl <= l && r <= dr) return t[d].sum;
      if(t[d].tag != 1) pushdown(d);
      int md = l + r >> 1, ans = 0;
      if(dl <= md) ans = query(d << 1, l, md, dl, dr);
      if(dr > md) ans = (ans + query(d << 1 | 1, md + 1, r, dl, dr)) % mod;
      return ans;
    }
}t[2];
inline void solve() {
  cin >> n, tot = 0;
  for(int i = 1; i <= n; ++i) cin >> a[i].l >> a[i].r >> a[i].c, num[++tot] = a[i].l, num[++tot] = a[i].r;
  sort(num + 1, num + 1 + tot), tot = unique(num + 1, num + 1 + tot) - num - 1;
  for(int i = 1; i <= n; ++i) {
    a[i].l = lower_bound(num + 1, num + 1 + tot, a[i].l) - num;
    a[i].r = lower_bound(num + 1, num + 1 + tot, a[i].r) - num;
  }
  sort(a + 1, a + 1 + n, [&](auto p, auto q) { return p.r < q.r; });
//  for(int i = 1; i <= n; ++i) cout << a[i].l << ' ' << a[i].r << ' ' << a[i].c << '\n';
  for(int i = 1; i <= tot; ++i) sum[0][i] = sum[1][i] = 0;
  for(int i = 1; i <= n; ++i) ++sum[a[i].c][a[i].r];
  for(int i = 1; i <= tot; ++i) sum[0][i] += sum[0][i - 1], sum[1][i] += sum[1][i - 1];
  t[0].build(1, 1, n), t[1].build(1, 1, n);
  for(int i = 1; i <= n; ++i) f[0][i] = f[1][i] = 0;
  int cnt[2] = {0, 0};
  for(int i = 1; i <= n; ++i) {
    ++cnt[a[i].c];
    f[a[i].c][i] = (t[!a[i].c].query(1, 1, n, 1, sum[!a[i].c][a[i].l - 1]) + pw[cnt[a[i].c] - 1]) % mod;
    t[!a[i].c].modify2(1, 1, n, 1, sum[!a[i].c][a[i].l - 1]);
    t[a[i].c].modify1(1, 1, n, cnt[a[i].c], f[a[i].c][i]);
  }

//  for(int i = 1; i <= tot; ++i) cout << sum[0][i] << ' '; cout << '\n';
//  for(int i = 1; i <= tot; ++i) cout << sum[1][i] << ' '; cout << '\n';
//  for(int i = 1; i <= n; ++i) cout << f[0][i] << ' '; cout << '\n';
//  for(int i = 1; i <= n; ++i) cout << f[1][i] << ' '; cout << '\n';

  int ans = 1;
  for(int i = 1; i <= n; ++i) ans = (ans + f[0][i]) % mod;
  for(int i = 1; i <= n; ++i) ans = (ans + f[1][i]) % mod;
  cout << ans << '\n';
}
int main() {
  ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  n = 1e5, pw[0] = ipw[0] = 1;
  for(int i = 1; i <= n; ++i) pw[i] = (pw[i - 1] << 1) % mod, ipw[i] = 1ll * ipw[i - 1] * inv2 % mod;
  cin >> T;
  while(T--) solve();
  return 0;
}