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

const int maxn = 1e5 + 5;

vector<int> g[maxn];
int n;
int ddl[maxn];
int parent[maxn];
long long a[maxn], b[maxn], c[maxn];
// int deg[maxn]; // number of children
using i128 = __int128;
i128 calc(int i, int s, int t) {
    if (c[i] >= 0 || b[i] + c[i] * t > 0) // 等差数列
        return (i128) (b[i] + s * c[i] + b[i] + t * c[i]) * (t - s + 1) / 2;
    int t0 = (b[i] - 1) / -c[i];
    if (s > t0)
        return t - s + 1;
    // [s..t0], [t0+1, t]
    return (i128) (b[i] + s * c[i] + b[i] + t0 * c[i]) * (t0 - s + 1) / 2 + (t - t0);
} 

bool check(int x) {
    for (int i = 1; i <= n; i++) {
        // 计算 ddl[i]
        int l = 0, r = x + 1;
        while (l + 1 < r) {
            int mid = (l + r) / 2;
            if (calc(i, mid, x) >= a[i])
                l = mid;
            else
                r = mid;
        }
        if (l == 0) return false;
        ddl[i] = l;
    }
    priority_queue<pair<int,int>> q;
    vector<int> deg(n + 1);
    for (int i = 2; i <= n; i++)
        deg[parent[i]]++;
    for (int i = 1; i <= n; i++)
        if (deg[i] == 0)
            q.push({ddl[i], i});

    int t = x;
    while (!q.empty()) {
        auto p = q.top();
        q.pop();
        if (t == 0) return false;
        t = min(t, p.first) - 1;
        int pa = parent[p.second];
        if (--deg[pa] == 0) {
            q.push({ddl[pa], pa});
        }
    }
    return true;
}

void dfs(int u, int p) {
    parent[u] = p;
    for (int v : g[u])
        if (v != p)
            dfs(v, u);
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i] >> b[i] >> c[i];
    for (int i = 0; i < n - 1; i++) {
        int u, v;
        cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    dfs(1, 0);
    // 二分答案。
    int l = n - 1, r = 1e9;
    while (l + 1 < r) {
        int x = (l + r) / 2;
        if (check(x))
            r = x;
        else
            l = x;
    }
    cout << r << '\n';
}