#include<algorithm>
#include<cstdio>
#include<cstring>
#include<queue>
typedef long long ll;
typedef __int128_t lll;
const int maxn=100000,inf=0x3f3f3f3f;
int n,head[maxn+1],total;
struct Edge{
	int to,next;
}e[(maxn-1)*2+1];
void add(const int u,const int v){
	e[++total]=Edge{v,head[u]};
	head[u]=total;
}
int fa[maxn+1],chcnt[maxn+1],tmp[maxn+1];
void dfs(const int u,const int from){
	fa[u]=from;
	chcnt[from]++;
	for(int i=head[u];i;i=e[i].next){
		const int v=e[i].to;
		if(v!=from)dfs(v,u);
	}
}
ll a[maxn+1];
int b[maxn+1],c[maxn+1],d[maxn+1],time[maxn+1];
std::priority_queue<std::pair<int,int>>q;
bool check(const int lim){
	memcpy(tmp+1,chcnt+1,sizeof(int)*n);
	for(int u=1;u<=n;u++){
		int l=0,r=lim,mid;
		lll sum;
		while(l<r){
			mid=(l+r+1)>>1;
			if(d[u]>lim)sum=ll(lim-mid+1)*b[u]+ll(lim+mid)*(lim-mid+1)/2*(lll)c[u];
			else if(d[u]<mid)sum=lim-mid+1;
			else sum=ll(d[u]-mid+1)*b[u]+ll(d[u]+mid)*(d[u]-mid+1)/2*(lll)c[u]+(lim-d[u]);
			if(sum>=a[u])l=mid;
			else r=mid-1;
		}
		if(l==0)return false;
		time[u]=l;
	}
	for(int u=1;u<=n;u++)
		if(chcnt[u]==0)
			q.emplace(time[u],u);
	int t=n;
	while(!q.empty()){
		const int u=q.top().second;
		q.pop();
		if(time[u]<t)return false;
		t--;
		if(fa[u]&&!(--tmp[fa[u]]))q.emplace(time[fa[u]],fa[u]);
	}
	return true;
}
int main(){
	//freopen("tree.in","r",stdin);
	//freopen("tree.out","w",stdout);
	scanf("%d",&n);
	for(int u=1;u<=n;u++){
		scanf("%lld%d%d",a+u,b+u,c+u);
		if(c[u]<0)d[u]=(b[u]-1)/(-c[u]);
		else d[u]=inf;
	}
	for(int i=1,u,v;i<n;i++){
		scanf("%d%d",&u,&v);
		add(u,v),add(v,u);
	}
	dfs(1,0);
	int l=n,r=1000000000,mid;
	while(l<r){
		mid=(l+r)>>1;
		if(check(mid))r=mid;
		else l=mid+1;
	}
	printf("%d\n",l);
	return 0;
}