#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
#define fir first
#define sec second
const int maxn=1e5+10;
const int lim=1e9;

inline ll read(){
    ll x=0,w=1;char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')w=-1;c=getchar();}
    while(c<='9'&&c>='0'){x=(x<<3)+(x<<1)+c-'0';c=getchar();}
    return x*w;
}

int n;
struct edge{
    int to,nxt;
}e[maxn<<1];
int head[maxn],cnt;
inline void add_edge(int u,int v){
    e[++cnt].to=v,e[cnt].nxt=head[u],head[u]=cnt;
    e[++cnt].to=u,e[cnt].nxt=head[v],head[v]=cnt;
}
ll a[maxn];
int b[maxn],c[maxn];
int fa[maxn];
void dfs1(int u,int f){
    fa[u]=f;
    for(int i=head[u],v;i;i=e[i].nxt){
        v=e[i].to;
        if(v==f) continue;
        dfs1(v,u);
    }
}

int t[maxn],f[maxn];
inline __int128_t calc(int id,int L,int R){
    if(c[id]>=0) return (__int128_t)b[id]*(R-L+1)+(__int128_t)c[id]*(L+R)*(R-L+1)/2;
    else{
        int k=(b[id]-1)/(-c[id]);
        if(k<L) return R-L+1;
        else if(k>=R) return (__int128_t)b[id]*(R-L+1)+(__int128_t)c[id]*(L+R)*(R-L+1)/2;
        else return (__int128_t)b[id]*(k-L+1)+(__int128_t)c[id]*(L+k)*(k-L+1)/2+(R-k);
    }
}
void dfs2(int u){
    f[u]=t[u];
    for(int i=head[u],v;i;i=e[i].nxt){
        v=e[i].to;
        if(v==fa[u]) continue;
        dfs2(v);
        f[u]=min(f[u],f[v]-1);
    }
}
priority_queue<pii> PQ;
inline bool check(int X){
    for(int i=1;i<=n;++i){
        t[i]=-1;
        int L=1,R=n;
        while(L<=R){
            int mid=(L+R)>>1;
            if(calc(i,mid,X)>=a[i]) t[i]=mid,L=mid+1;
            else R=mid-1;
        }
        if(t[i]==-1) return false;
    }
    dfs2(1);
    while(!PQ.empty()) PQ.pop();
    PQ.push(make_pair(-f[1],1));
    for(int i=1;i<=n;++i){
        int u=PQ.top().sec;
        PQ.pop();
        if(i>f[u]) return false;
        for(int j=head[u],v;j;j=e[j].nxt){
            v=e[j].to;
            if(v==fa[u]) continue;
            PQ.push(make_pair(-f[v],v));
        }
    }
    return true;
}

int ans;

int main(){
    n=read();
    for(int i=1;i<=n;++i) a[i]=read(),b[i]=read(),c[i]=read();
    for(int i=1,u,v;i<n;++i){
        u=read(),v=read();
        add_edge(u,v);
    }
    dfs1(1,0);
    int L=n,R=lim;
    while(L<=R){
        int mid=(L+R)>>1;
        if(check(mid)) ans=mid,R=mid-1;
        else L=mid+1;
    }
    printf("%d\n",ans);
    return 0;
}