#include <bits/stdc++.h>
using namespace std; 
typedef long long i64; 
typedef __int128 lll; 
const int INF = 1e9 + 1; 

inline i64 read(void) {
    i64 x = 0; int c = getchar(), f = 1; 
    while (!isdigit(c)) { if (c == '-') f = -1; c = getchar(); } 
    while (isdigit(c)) x = (x << 3) + (x << 1) + (c ^ 48), c = getchar(); 
    return x * f; 
}

int n; 
i64 a[100005]; int b[100005], c[100005], tt[100005]; 
i64 st[100005]; // 最晚在 st 开始种植
vector<int> G[100005]; 

inline lll calc(int x, lll l, lll r) {
    if (c[x] >= 0) return (r - l + 1) * b[x] + (l + r) * (r - l + 1) / 2 * c[x];
    if (tt[x] < l) return r - l + 1;
    if (tt[x] > r) return (r - l + 1) * b[x] + (l + r) * (r - l + 1) / 2 * c[x];
    return (tt[x] - l + 1) * b[x] + (l + tt[x]) * (tt[x] - l + 1) / 2 * c[x] + r - tt[x];
}

int mn[100005], f[100005]; 
void dfs(int x, int fa) {
    mn[x] = st[x]; f[x] = fa; 
    for (int y : G[x]) if (y != fa) {
        dfs(y, x); 
        mn[x] = min(mn[x], mn[y] - 1); 
    }
}

inline bool check(i64 ed) { // 在 ed 天结束种植
    for (int i = 1; i <= n; ++i) {
        if (c[i] == 0) st[i] = ed - (a[i] + b[i] - 1) / b[i] + 1; 
        else {
            int L = 0, R = ed + 1; 
            while (L + 1 != R) {
                int mid = L + R >> 1; 
                if (calc(i, mid, ed) >= a[i]) L = mid; 
                else R = mid; 
            }
            st[i] = L; 
        }
        if (st[i] <= 0) return 0; 
    }
    dfs(1, 0); 
    sort(mn + 1, mn + n + 1); 
    for (int i = 1; i <= n; ++i) if (mn[i] < i) return 0; 
    return 1; 
}

int main(void) {
    n = read();  
    for (int i = 1; i <= n; ++i) {
        a[i] = read(), b[i] = read(), c[i] = read(); 
        if (c[i] < 0) tt[i] = (b[i] - 1) / -c[i]; 
    }
    for (int i = 1, u, v; i < n; ++i) {
        u = read(), v = read(); 
        G[u].emplace_back(v); G[v].emplace_back(u); 
    }
    int L = n - 1, R = INF;  
    while (L + 1 != R) {
        int mid = L + R >> 1; 
        if (check(mid)) R = mid; 
        else L = mid; 
    }
    printf("%d\n", R); 
    return 0; 
}