#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
typedef long long ll;
typedef pair<ll, ll> pii;
const ll N = 1e5 + 10;
ll n;
ll s[N], req[N], d[N], dp[N];
vector<pii> g[N], hull, del[N];
vector<ll> path;
bool cmp(pii x, pii y){
if ((x.F / x.S) != (y.F / y.S))
return (x.F / x.S) > (y.F / y.S);
x.F %= x.S;
y.F %= y.S;
return (x.F * y.S) > (y.F * x.S);
}
bool useful(pii x, pii y, pii z){
return cmp({x.S - y.S, y.F - x.F}, {y.S - z.S, z.F - y.F});
}
void insert(ll v, pii L){
while (hull.size() > 1 and !useful(hull[hull.size() - 2], hull.back(), L)){
del[v].push_back(hull.back());
hull.pop_back();
}
hull.push_back(L);
}
ll f(pii L, ll x){
return L.F * x + L.S;
}
ll query(ll x){
ll ans = f(hull[0], x);
ll lo = 0, hi = hull.size();
while (hi - lo > 1){
ll mid = (lo + hi) / 2;
ll ans1 = f(hull[mid - 1], x);
ll ans2 = f(hull[mid], x);
if (ans1 < ans2){
ans = ans1;
hi = mid;
}
else{
ans = ans2;
lo = mid;
}
}
return ans;
}
void dfs(ll v, ll p = -1){
for (auto [w, u] : g[v]){
if (u == p) continue;
d[u] = d[v] + w;
dp[u] = query(-s[u]) + s[u] * d[u] + req[u];
insert(u, {d[u], dp[u]});
dfs(u, v);
}
hull.pop_back();
while (del[v].size())
hull.push_back(del[v].back()), del[v].pop_back();
}
int main(){
cin >> n;
for (ll i = 0; i < n - 1; i ++){
ll u, v, w;
cin >> u >> v >> w;
g[u].push_back({w, v});
g[v].push_back({w, u});
}
for (ll i = 2; i <= n; i ++)
cin >> req[i] >> s[i];
insert(1, {0, 0});
dfs(1);
for (ll i = 2; i <= n; i ++)
cout << dp[i] << " ";
cout << endl;
}
