// vaziat meshki-ghermeze !
#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
const int N = 2e5 + 10;
map<int, ll> mp[N];
int a[N], h[N], c[N];
vector<int> G[N];
void DFS(int u){
for(auto adj : G[u]){
if(adj == u) continue;
DFS(adj);
if(mp[adj].size() > mp[u].size())
mp[u].swap(mp[adj]);
for(auto [la, sm] : mp[adj])
mp[u][la] += sm;
}
ll del = c[u];
while(del){
auto it = mp[u].lower_bound(h[u] + 1);
if(it == mp[u].end())
break;
ll rm = min(del, it -> S);
del -= rm;
if(rm < it -> S){
mp[u][it -> F] -= rm;
} else mp[u].erase(it);
}
mp[u][h[u]] += c[u];
}
int mk[N];
ll ans = 0;
int loop[N], con[N];
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
cin >> n;
for(int i = 1; i <= n; i++){
cin >> a[i] >> h[i] >> c[i];
ans += c[i];
h[i] = -h[i];
}
for(int i = 1; i <= n; i++){
if(mk[i]) continue;
int nw = i;
while(!mk[nw]){
mk[nw] = i;
nw = a[nw];
}
if(mk[nw] < i) continue;
int st = nw;
vector<int> P = {st};
nw = a[nw];
while(st != nw){
P.pb(nw);
nw = a[nw];
}
sort(all(P), [&](int i, int j){
return h[i] < h[j];
});
for(auto x : P) loop[x] = 1;
a[P[0]] = P[0];
for(int i = 1; i < (int) P.size(); i++) a[P[i]] = P[i - 1];
for(auto x : P) con[x] = P.back();
}
for(int i = 1; i <= n; i++){
if(!loop[i] && loop[a[i]])
a[i] = con[a[i]];
G[a[i]].pb(i);
}
for(int i = 1; i <= n; i++)
if(a[i] == i){
DFS(i);
for(auto [x, y] : mp[i])
ans -= y;
}
cout << ans << '\n';
return 0;
}
