// luogu-judger-enable-o2

#include<bits/stdc++.h>

#define reg register int

#define il inline

#define fi first

#define se second

#define mk(a,b) make_pair(a,b)

#define numb (ch^'0')

#define pb push_back

#define solid const auto &

#define enter cout<<endl

#define pii pair<int,int>

using namespace std;

typedef long long ll;

template<class T>il void rd(T &x){

    char ch;x=;bool fl=false;while(!isdigit(ch=getchar()))(ch=='-')&&(fl=true);

    for(x=numb;isdigit(ch=getchar());x=x*+numb);(fl==true)&&(x=-x);}

template<class T>il void output(T x){if(x/)output(x/);putchar(x%+'');}

template<class T>il void ot(T x){if(x<) putchar('-'),x=-x;output(x);putchar(' ');}

template<class T>il void prt(T a[],int st,int nd){for(reg i=st;i<=nd;++i) ot(a[i]);putchar('\n');}

namespace Modulo{

const int mod=;

il int ad(int x,int y){return x+y>=mod?x+y-mod:x+y;}

il int sub(int x,int y){return ad(x,mod-y);}

il int mul(int x,int y){return (ll)x*y%mod;}

il void inc(int &x,int y){x=ad(x,y);}

il void inc2(int &x,int y){x=mul(x,y);}

il int qm(int x,int y=mod-){int ret=;while(y){if(y&) ret=mul(x,ret);x=mul(x,x);y>>=;}return ret;}

template<class ...Args>il int ad(const int a,const int b,const Args &...args) {return ad(ad(a,b),args...);}

template<class ...Args>il int mul(const int a,const int b,const Args &...args) {return mul(mul(a,b),args...);}

}

using namespace Modulo;

namespace Miracle{

const int N=;

int n;

int p[N][];

struct node{

    int nxt,to;

    int val;

}e[*N];

int hd[N],cnt;

void add(int x,int y,int c){

    e[++cnt].nxt=hd[x];

    e[cnt].to=y;e[cnt].val=c;

    hd[x]=cnt;

}

int f[N][];

int g[];

int sz[N];

int ni[*N];

void dfs(int x,int fa){

    f[x][]=;

    sz[x]=;

    for(reg i=hd[x];i;i=e[i].nxt){

        int y=e[i].to;

        if(y==fa) continue;

        dfs(y,x);

        if(e[i].val==){

            for(reg j=*sz[x];j>=;--j){

                for(reg k=*sz[y];k>=;--k){

                    inc(f[x][j+k],mul(f[x][j],f[y][k]));

                }

                f[x][j]=;

            }

        }else{

            for(reg j=*sz[x];j>=;--j){

                int tot=;

                int v=f[x][j];

                for(reg k=*sz[y];k>=;--k){

                    inc(f[x][j+k],mul(mod-,f[x][j],f[y][k]));

                    inc(tot,f[y][k]);

                }

                f[x][j]=;

                inc(f[x][j],mul(v,tot));

            }

        }

        sz[x]+=sz[y];

    }

    ++sz[x];

    memset(g,,sizeof g);

    for(reg i=*sz[x];i>=;--i){

        for(reg j=;j<=&&i-j>=;++j){

            inc(g[i],mul(p[x][j],j,ni[i],f[x][i-j]));

        }

    }

    memcpy(f[x],g,sizeof g);

}

int main(){

    rd(n);

    int a1,a2,a3;

    ni[]=;

    for(reg i=;i<=*n;++i) {

        ni[i]=mul(mod-mod/i,ni[mod%i]);

    }

    for(reg i=;i<=n;++i){

        rd(a1);rd(a2);rd(a3);int tot=qm(ad(a1,a2,a3));

        p[i][]=mul(a1,tot),p[i][]=mul(a2,tot);

        p[i][]=mul(a3,tot);

    }

    int x,y;

    for(reg i=;i<n;++i){

        rd(x);rd(y);

        add(x,y,);add(y,x,-);

    }

    dfs(,);

    int ans=;

    for(reg j=;j<=*sz[];++j){

        inc(ans,f[][j]);

    }

    cout<<ans;

    return ;

}

}

signed main(){

    Miracle::main();

    return ;

}

/*

   Author: *Miracle*

*/