#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef long double ld;

const int N = 200500, mod = 998244353;

int n;
vector<pair<int, int> > g[N];
vector<int> ga[N];
int tin[N], tout[N], timer;
int sz[N];

int pr[N], csz[N];

int st[N], stn;
ll ans;

void dfs(int v, int p) {
    tin[v] = ++timer;
    sz[v] = 1;
    for (auto it: g[v]) {
        int to = it.first;
        int w = it.second;
        if (to == p)
            continue;
        dfs(to, v);
        sz[v] += sz[to];
        ga[w].push_back(to);
    }
    tout[v] = timer;
}

bool upper(int v, int u) {
    return tin[v] <= tin[u] && tin[u] <= tout[v];
}

void f(vector<int> &a) {
    sort(a.begin(), a.end(), [](int v, int u) {
        return tin[v] < tin[u];
    });
    stn = 0;
    st[stn++] = 0;
    csz[0] = n;
    for (auto v: a) {
        csz[v] = sz[v];
        while (!upper(st[stn - 1], v))
            stn--;
        csz[st[stn - 1]] -= sz[v];
        pr[v] = st[stn - 1];
        st[stn++] = v;
    }
    for (auto v: a) {
        ans += 1ll * csz[v] * csz[pr[v]] % mod;
        ans %= mod;
    }
}

void solve() {
    cin >> n;
    for (int i = 0; i < n; i++) {
        g[i].clear();
        ga[i].clear();
    }
    for (int i = 0; i < n - 1; i++) {
        int v, u, w;
        cin >> v >> u >> w;
        v--, u--, w--;
        g[v].push_back({u, w});
        g[u].push_back({v, w});
    }
    dfs(0, 0);
    ans = 0;
    for (int i = 0; i < n; i++)
        f(ga[i]);
    ans %= mod;
    ans = ans * 2 % mod;
    while(ans % n != 0)
        ans += mod;
    ans /= n;
    while(ans % (n - 1) != 0)
        ans += mod;
    ans /= n - 1;
    ll s = 0;
    for (int i = 2; i <= n; i++)
        s ^= 1ll * i * (i - 1) / 2 % mod * ans % mod;
    cout << s << "\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    int tst;
    cin >> tst;
    while (tst--)
        solve();

    return 0;
}