1 #include<cstdio>
 2 #include<algorithm>
 3 #define rep(i,l,r) for (int i=(l); i<=(r); i++)
 4 #define For(i,x) for (int i=h[x],k; i; i=nxt[i])
 5 typedef long long ll;
 6 using namespace std;
 7
 8 const int N=3010,mod=998244353,inf=1e9;
 9 int n,rt,ans,cnt,u,v,inv[N],a[N],b[N],c[N],s[N],f[N][N],sz[N],g[N],h[N],to[N],val[N],nxt[N];
10
11 void add(int u,int v,int w){ to[++cnt]=v; val[cnt]=w; nxt[cnt]=h[u]; h[u]=cnt; }
12 void inc(int &x,int y){ x=(x+y>=mod) ? x+y-mod : x+y; }
13 void dec(int &x,int y){ x=(x-y<0) ? x-y+mod : x-y; }
14
15 int ksm(int a,int b){
16     int res=1;
17     for (; b; a=1ll*a*a%mod,b>>=1)
18         if (b & 1) res=1ll*res*a%mod;
19     return res;
20 }
21
22 void dfs(int x,int fa){
23     sz[x]=1;
24     f[x][1]=1ll*a[x]*s[x]%mod;
25     f[x][2]=2ll*b[x]*s[x]%mod;
26     f[x][3]=3ll*c[x]*s[x]%mod;
27     For(z,x) if ((k=to[z])!=fa){
28         dfs(k,x);
29         rep(i,1,sz[x]*3) rep(j,1,sz[k]*3){
30             int t=1ll*f[x][i]*f[k][j]%mod;
31             if (val[z]) dec(g[i+j],t),inc(g[i],t); else inc(g[i+j],t);
32         }
33         sz[x]+=sz[k];
34         rep(i,1,sz[x]*3) f[x][i]=g[i],g[i]=0;
35     }
36     rep(i,1,sz[x]*3) f[x][i]=1ll*f[x][i]*inv[i]%mod;
37 }
38
39 int main(){
40     freopen("fgo.in","r",stdin);
41     freopen("fgo.out","w",stdout);
42     scanf("%d",&n);
43     rep(i,1,3*n) inv[i]=ksm(i,mod-2);
44     rep(i,1,n) scanf("%d%d%d",&a[i],&b[i],&c[i]),s[i]=ksm(a[i]+b[i]+c[i],mod-2);
45     rep(i,2,n) scanf("%d%d",&u,&v),add(u,v,0),add(v,u,1);
46     dfs(1,1);
47     rep(i,1,sz[1]*3) inc(ans,f[1][i]);
48     printf("%d\n",ans);
49     return 0;
50 }