const int N = 2e5+3;
const lli MOD = 998244353;
vector<pair<lli, lli>> a(N);

void dfs(int node, int par, vector<tuple<int,lli,lli>> g[]) {
    
    lli p = a[node].first;
    lli q = a[node].second;
    
    for(auto [j,x,y] : g[node]) {
        if(j != par) {
            a[j].first = (p % MOD * y % MOD) % MOD;
            a[j].second = (q % MOD * x % MOD) % MOD;
        }
    }
    for(auto [j,x,y] : g[node]) {
        if(j != par) {
            dfs(j,node,g);
        }
    }
}

lli LCM(lli a, lli b) {
    return (a*b) / __gcd(a,b);
}
void solve(){ 
    
    int n;
    cin >> n;
    
    vector<tuple<int,lli,lli>> g[n+1];
    FOR(k,1,n-1) {
        int i,j,x,y;
        read(i,j,x,y);
        g[i].pb({j,x,y});
        g[j].pb({i,y,x});
    }
    
    a[1] = {1,1};
    dfs(1,0,g);
    
    lli lcm = 1 , ans = 0;
    FOR(i,2,n) {
        lcm = LCM(lcm, a[i].second);
        lcm %= MOD;
    }
    
    FOR(i,1,n) {
        ans += a[i].first * (lcm/a[i].second);
        ans %= MOD;
    }
    ans /= __gcd(ans,lcm);
    cout << ans << '\n';
    
} 

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    
    int t;
    cin>>t;
    while(t--)
    solve();
	
	return 0;
}