#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll N=2e5+10;
const ll mod=998244353;
ll t,n;
struct node{ll a,b,c;};
vector<node> g[N];
vector<ll> v[N];
ll __gcd(ll x,ll y){if(y==0) return x;else return __gcd(y,x%y);}
ll p[N],maxn[N];
ll primes[N], cnt; // primes[]存储所有素数
bool st[N]; // st[x]存储x是否被筛掉
void get_primes(ll n)
{
for (ll i = 2; i <= n; i ++ )
{
if (!st[i]) primes[cnt ++ ] = i;
for (ll j = 0; primes[j] <= n / i; j ++ )
{
st[primes[j] * i] = true;
if (i % primes[j] == 0) break;
}
}
}
ll qpow(ll a,ll b){
ll res=1;
while(b){
if(b&1) res=res*a%mod;
a=a*a%mod;
b=b>>1;
}
return res;
}
void getfac(){
for(ll i=2;i<N;i++){
ll NOW=i;
for(ll j=0;primes[j]*primes[j]<=NOW;j++){
while(NOW%primes[j]==0){
v[i].push_back(primes[j]);
NOW=NOW/primes[j];
}
}
if(NOW>1) v[i].push_back(NOW);
}
}
void init(){for(ll i=0;i<=n;i++) p[i]=maxn[i]=0,g[i].clear();}
void dfs(ll now,ll fa){
for(ll i=0;i<g[now].size();i++){
ll to=g[now][i].a,x=g[now][i].b,y=g[now][i].c;
if(to==fa) continue;
// cout<<now<<endl;
for(auto it:v[x]) ++p[it],maxn[it]=max(maxn[it],p[it]);
for(auto it:v[y]) --p[it];
dfs(to,now);
for(auto it:v[x]) --p[it];
for(auto it:v[y]) ++p[it];
}
}
ll res=0;
void dfs2(ll now,ll fa,ll P){
res=(res+P)%mod;
for(ll i=0;i<g[now].size();i++){
ll to=g[now][i].a,x=g[now][i].b,y=g[now][i].c;
if(to==fa) continue;
ll tmp=P;
for(auto it:v[x]) tmp=tmp*qpow(it,mod-2)%mod;
for(auto it:v[y]) tmp=tmp*it%mod;
dfs2(to,now,tmp);
}
}
int main(){
get_primes(N-1);
getfac();
scanf("%lld",&t);
while(t--){
scanf("%lld",&n);
for(ll _=1;_<n;_++){
ll i,j,x,y,tmp;scanf("%lld%lld%lld%lld",&i,&j,&x,&y);
tmp=__gcd(x,y);
g[i].push_back({j,x/tmp,y/tmp});
g[j].push_back({i,y/tmp,x/tmp});
}
dfs(1,-1);
ll P=1;res=0;
for(ll i=1;i<=n;i++) for(ll j=1;j<=maxn[i];j++) P=P*i%mod;
dfs2(1,-1,P);
cout<<res<<endl;
init();
}
}
12-19
166
03-21
1061
03-25
1151
03-25
476
03-22
442