#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 2e18;
ll nxt[200010];
vector<ll> rev[200010];
ll H[200010], C[200010];
ll vis[200010];
ll st = -1;
ll cy[200010];
vector<ll> v[200010];
void dfs(ll x, ll num) {
vis[x] = num;
if (vis[nxt[x]] == num) {
st = num;
return;
}
if (vis[nxt[x]]) return;
dfs(nxt[x], num);
}
void push_cycle(ll x, ll num) {
cy[x] = num;
v[num].push_back(x);
if (cy[nxt[x]]) return;
push_cycle(nxt[x], num);
}
ll par[200010];
multiset<pair<ll,ll>> ms[200010];
ll Find(ll x) {
if (x == par[x]) return x;
return par[x] = Find(par[x]);
}
void Union(ll x, ll y) {
x = Find(x);
y = Find(y);
if (x == y) return;
if (ms[x].size() < ms[y].size()) swap(x, y);
for (auto &[i, add] : ms[y]) {
ms[x].insert({i, add});
}
par[y] = x;
}
void dfs2(ll x) {
for (auto &y : rev[x]) {
dfs2(y);
Union(x, y);
}
ll X = Find(x);
ll cur = C[x];
for (auto it = ms[X].upper_bound({H[x], inf}); it != ms[X].end(); ) {
if (cur < it->second) {
auto t = *it;
ms[X].erase(it);
ms[X].insert({t.first, t.second - cur});
break;
}
cur -= it->second;
it = ms[X].erase(it);
}
ms[X].insert({H[x], C[x]});
}
int main() {
ios_base :: sync_with_stdio(false); cin.tie(NULL);
ll n;
cin >> n;
ll ans = 0;
for (ll i=1; i<=n; i++) {
cin >> nxt[i] >> H[i] >> C[i];
H[i] *= -1;
rev[nxt[i]].push_back(i);
ans += C[i];
par[i] = i;
}
ll num = 0, num2 = 0;
for (ll i=1; i<=n; i++) {
if (vis[i]) continue;
st = -1;
dfs(i, ++num);
if (st != -1) {
push_cycle(st, ++num2);
}
}
for (ll i=1; i<=num2; i++) {
map<ll,ll> mp;
ll pv = -1;
for (auto &x : v[i]) {
for (auto &y : rev[x]) {
if (cy[y]) continue;
dfs2(y);
if (pv == -1) pv = y;
else Union(pv, y);
}
if (mp.find(H[i]) != mp.end()) {
mp[H[i]] += C[i];
}
else {
mp[H[i]] = C[i];
}
}
ll mx = 0;
if (pv == -1) {
for (auto &[i, add] : mp)
mx = max(mx, add);
}
else {
pv = Find(pv);
vector<pair<ll,ll>> func;
for (auto &[i, add] : ms[pv]) {
func.push_back({i, add});
}
for (ll i=0; i+1<func.size(); i++) {
func[i+1].second += func[i].second;
}
for (auto &[i, add] : mp) {
ll idx = upper_bound(func.begin(), func.end(), make_pair(i, inf)) - func.begin() - 1;
if (idx == -1) mx = max(mx, add);
else mx = max(mx, func[idx].second + add);
}
mx = max(mx, func.back().second);
}
ans -= mx;
}
cout << ans << '\n';
}
