#include <bits/stdc++.h>
#define ll long long
using namespace std;
/*
Face the Fear, Make the Future.
FILE OPERATION IF NEEDED!!!
Problem: C. Completely Searching for Inversions
*/

const int N = 1e5 + 7;
const ll mod = 998244353;
vector<pair<int, int>> g[N];
ll cnt[N][2], now, f[N], dp[N];

void dfs(int u){
    f[u] = 1;
    for(auto [v, w]: g[u]){
        now += w, now %= mod;
        ll tmp = now;
        if(f[v] == 0) dfs(v);
        else now += cnt[v][1], now %= mod;
        cnt[u][0] += cnt[v][0] + (w == 0), cnt[u][0] %= mod;
        cnt[u][1] += cnt[v][1] + (w == 1), cnt[u][1] %= mod;
        dp[u] += dp[v] + tmp * cnt[v][0] % mod, dp[u] %= mod;
    }
}

void solve(){
    int n;
    cin >> n;
    for(int i = 1, s; i <= n; i ++){
        cin >> s;
        while(s --){
            int v, w; cin >> v >> w;
            g[i].push_back({v, w});
        }
    }
    dfs(1);
    cout << dp[1] << "\n";
}

int main(){
    int t = 1;
    while(t --){
        solve();
    }
    return 0;
}

第一个大数据就挂了。 test 6 输出的是 0。 dfs 写得有些晕