/* code by the cute PixelCat owo */
/* as cute as nacho neko (aka. my wife)! */
// #pragma GCC
// optimize("O4,unroll-loops,no-stack-protector")
#include <bits/stdc++.h>
#define int LL //__int128
#define double long double
using namespace std;
using LL = long long;
using uLL = unsigned long long;
using pii = pair<int, int>;
#define For(i, a, b) for (int i = a; i <= b; i++)
#define Fors(i, a, b, s) for (int i = a; i <= b; i += s)
#define Forr(i, a, b) for (int i = a; i >= b; i--)
#define F first
#define S second
#define L(id) (id * 2 + 1)
#define R(id) (id * 2 + 2)
#define LO(x) (x & (-x))
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define mkp make_pair
// #define MOD (int)(998244353)
#define MOD (int)(1e9 + 7)
#define INF (int)(9000000000000000000ll) // 9e18
#define EPS (1e-6)
#ifdef NYAOWO
#include "library/debug.hpp"
inline void USACO(const string &s) {
cerr << "USACO: " << s << "\n";
}
#else
#define debug(...)
inline void timer() {}
inline void USACO(const string &s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
#endif
inline void NYA() {
ios::sync_with_stdio(false);
cin.tie(0);
}
inline int gcd(int a, int b) {
return __gcd(a, b);
}
inline int lcm(int a, int b) {
return a / gcd(a, b) * b;
}
int fpow(int b, int p, const int &mod) {
int ans = 1;
while (p) {
if (p & 1) ans = ans * b % mod;
p /= 2;
b = b * b % mod;
}
return ans;
}
int fpow(int b, int p) {
return fpow(b, p, MOD);
}
template <typename T>
inline void chmin(T &_a, const T &_b) {
if (_b < _a) _a = _b;
}
template <typename T>
inline void chmax(T &_a, const T &_b) {
if (_b > _a) _a = _b;
}
// mt19937_64 rng(
// chrono::steady_clock::now().time_since_epoch().count());
const int MAXN=5010;
int a[MAXN];
int x[MAXN];
int c[MAXN];
int dp[MAXN][MAXN];
int32_t main() {
NYA();
// nyaacho >/////<
// miku sama bless me >/////<
int n; cin>>n;
vector<int> al;
For(i,1,n){
cin>>a[i]>>x[i]>>c[i];
al.eb(x[i]);
}
sort(all(al));
al.erase(unique(all(al)),al.end());
int m=sz(al);
For(i,1,n){
x[i]=upper_bound(all(al),x[i])-al.begin();
For(j,1,m) if(j!=x[i]) dp[i][j]=c[i];
}
Forr(i,n,2){
Forr(j,m-1,1) chmin(dp[i][j],dp[i][j+1]);
For(j,1,m) dp[a[i]][j]+=dp[i][j];
}
int ans=INF;
For(i,1,m) chmin(ans,dp[1][i]);
cout<<ans<<"\n";
return 0;
}
