#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
using ll = long long;
const int INF = 0x7ffffff;
const int N = 1e4 + 10;
vector<int>g[N];
int sum[N], maxv[N];
int n; int a, b, w[N]; int cnt; int answer;
void dfs(int u, int f) {
	int maxx = 0; sum[u] = w[u];
	for (const auto& x : g[u]) {
		if (x == f)continue;
		dfs(x, u);
		sum[u] += sum[x];
		if (sum[x] > maxx)maxx = sum[x];
	}
	if (cnt - sum[u] > maxx)maxx = cnt - sum[u];
	maxv[u] = maxx;
}
void distance(int u, int f, int dep) {
	answer += dep * w[u];
	for (const auto& x : g[u]) {
		if (x == f)continue;
		distance(x, u, dep + 1);
	}
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr); cout.tie(nullptr);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> w[i] >> a >> b;
		cnt += w[i];
		if (a) {
			g[i].push_back(a);
			g[a].push_back(i);
		}
		if (b) {
			g[i].push_back(b);
			g[b].push_back(i);
		}
	}
	dfs(1, -1);
	int ans = INF; int id = 0;
	for (int i = 1; i <= n; i++) {
		if (maxv[i] < ans) {
			ans = maxv[i];
			id = i;
		}
	}
	distance(id, -1, 0);
	cout << answer;
	return 0;
}