#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<queue>
#include<map>
#define int __int128
using namespace std;
const int MAXN=5e5+5;
inline int read()
{
    int SS=0,WW=1;
    char ch=getchar();
    while(ch<'0'||ch>'9')
	{
        if(ch=='-')WW=-1;
        ch = getchar();
    }
    while(ch>='0'&&ch<='9')
	{
        SS=(SS<<1)+(SS<<3)+(ch^48);
        ch=getchar();
    }
    return SS*WW;
}
inline void write(int XX)
{
    if(XX<0)putchar('-'),XX=-XX;
    if(XX>9)write(XX/10);
    putchar(XX% 10 + '0');
}
int n,h[MAXN],ec,ans,p[MAXN],f[MAXN];
typedef pair<int,int> P;
queue<P>que;
struct Tree{
	int a,b,c,d;
}t[MAXN];
struct Edge{
	int u,v,nxt,w;
}e[MAXN];
struct Sort{
	int p,id;
}q[MAXN];
inline void Add(int u,int v)
{
	e[++ec].u=u,e[ec].v=v,e[ec].nxt=h[u];h[u]=ec;
	e[++ec].u=v,e[ec].v=u,e[ec].nxt=h[v];h[v]=ec;
}
inline int _count(int l,int r,int x)
{
	if(t[x].c>0)return (r-l+1)*t[x].b+(t[x].c*(r-l+1)*(r+l)>>1);
	else if(t[x].c==0)return (r-l+1)*t[x].b;
	else
	{
		if(l<t[x].d&&r>=t[x].d)return (r-t[x].d+1)+(t[x].d-l)*t[x].b+t[x].c*(t[x].d-l)*(t[x].d-1+l)/2;
		else if(t[x].d>r)return (r-l+1)*t[x].b+(t[x].c*(r-l+1)*(r+l)>>1);
		else if(t[x].d<=l)return (r-l+1);
	}
}
bool cmp(Sort A,Sort B)
{
	return A.p<B.p;
}
int vis[MAXN];
bool check(int m)
{
	memset(p,0,sizeof p);
	for(int i=1;i<=n;i++)
	{
		int l=0,r=m;
		if(_count(1,m,i)<t[i].a)return 0;
		while(l<r)
		{
			int mid=l+r>>1;
			if(_count(mid,m,i)>=t[i].a)l=mid+1,p[i]=mid;
			else r=mid;
		}
	}
//	for(int i=1;i<=n;i++)printf("+%d ",p[i]);puts("");
	for(int i=1;i<=n;i++)q[i].p=p[i],q[i].id=i;
	sort(q+1,q+1+n,cmp);memset(vis,0,sizeof vis);
	vis[1]=1;
	for(int i=1,time=1;i<=n;i++)
	{
		int tmp=q[i].id;
		int it=tmp,sum=0;
		while(!vis[it])sum++,it=f[it];
		it=tmp;
		while(!vis[it])vis[it]=time+sum,it=f[it];
		time=max(vis[tmp],time);
	}//for(int i=1;i<=n;i++)printf("%d->",vis[i]);puts("");
	for(int i=1;i<=n;i++)if(vis[i]>p[i])return 0;
	/*
	for(int i=1;i<=n;i++)printf("%lld ",p[i]);printf("%lld\n",m);
	int time=0;
	while(!que.empty())que.pop();
	que.push(P(p[1],1));
	while(!que.empty()){
		int px=que.top().first,id=que.top().second;
		que.pop();
		vis[id]=1;
		if((time++)>px)return 0;
		for(int i=h[id];i;i=e[i].nxt)
		{
			int v=e[i].v;
			if(!vis[v])que.push(P(p[v],v));
		}
	}*/
	return 1;
}
main()
{
//	freopen("tree.in","r",stdin);freopen("tree.out","w",stdout);
	n=read();
	for(int i=1;i<=n;i++)t[i].a=read(),t[i].b=read(),t[i].c=read();
	for(int i=1;i<=n;i++)if(t[i].c<0)t[i].d=(t[i].b-2)/-t[i].c+1;
	for(int i=1,u,v;i<n;i++)
	{
		u=read(),v=read();
		Add(u,v);
	}
	que.push(P(1,0));
	while(!que.empty())
	{
		int x=que.front().first,fa=que.front().second;
		que.pop();
		f[x]=fa;
		for(int i=h[x];i;i=e[i].nxt)
		{
			int v=e[i].v;
			if(v!=fa)que.push(P(v,x));
		}
	}
	int l=0,r=1e9;
	while(l<r)
	{
		int mid=l+r>>1;
		if(check(mid))ans=mid,r=mid;
		else l=mid+1;
	}
	write(ans);
	return 0;
}