#include<iostream>
#include<string>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<vector>
using namespace std;
typedef long long s64;

const int ONE = 1000005;
const s64 INF = 1e18;

#define next nxt

int get()
{
		int res = 1, Q = 1; char c;
		while( (c = getchar()) < 48 || c > 57)
			if(c == '-') Q = -1;
		if(Q) res = c - 48;
		while( (c = getchar()) >= 48 && c <= 57)
			res = res * 10 + c - 48;
		return res * Q;
}

struct power
{
		s64 a, b;
		bool operator <(power A) const
		{
			if(A.a != a) return a < A.a;
			return b < A.b;
		}
};
vector <power> A[ONE], R;

int n;
int x, y;
s64 l, r, K;
int next[ONE], first[ONE], go[ONE], w[ONE], tot;
int size[ONE], fat[ONE];

void Add(int u, int v, int z)
{
		next[++tot] = first[u], first[u] = tot, go[tot] = v, w[tot] = z;
		next[++tot] = first[v], first[v] = tot, go[tot] = u, w[tot] = z;
}

int dist[ONE];
int len_x, len_y;
s64 a1, b1, a2, b2;

int Find()
{
		if(len_y == 0) return len_y;
		int l = 0, r = len_y - 1;
		while(l < r - 1)
		{
			int mid = l + r >> 1;
			a2 = A[y][mid].a, b2 = A[y][mid].b;
			if(b1 + a2 + dist[x] + dist[y] <= K) l = mid;
			else r = mid;
		}
		a2 = A[y][r].a, b2 = A[y][r].b; if(b1 + a2 + dist[x] + dist[y] <= K) return r;
		a2 = A[y][l].a, b2 = A[y][l].b; if(b1 + a2 + dist[x] + dist[y] <= K) return l;
		return len_y;
}

void Update(int u)
{
		x = 0, y = 0;
		for(int e = first[u]; e; e = next[e])
			if(go[e] != fat[u])
				if(!x) x = go[e]; else y = go[e];

		if(size[x] > size[y]) swap(x, y);
	//	cout<<"FKFKFKFK===="<<u<<" "<<x<<" "<<y<<endl;

		len_x = A[x].size(), len_y = A[y].size();

		R.clear();
		for(int i = 0; i < len_x; i++)
		{
			a1 = A[x][i].a, b1 = A[x][i].b;
			if(Find() >= len_y) continue;
		//	cout<<y<<" "<<len_y<<" "<<id<<endl;
		//	cout<<u<<"======"<<dist[x]<<","<<b2+dist[y]<<endl;
			R.push_back((power){a1 + dist[x], b2 + dist[y]});
			R.push_back((power){b2 + dist[y], a1 + dist[x]});
		}
	//	cout<<"FKFKFKFK===="<<u<<" "<<x<<" "<<y<<endl;


		sort(R.begin(), R.end());
		int len = R.size();
		s64 maxx = INF;
/*		cout<<u<<":"<<endl;
		for(int i = 0; i < len; i++)
			cout<<R[i].a<<" "<<R[i].b<<endl;
*/
		for(int i = 0; i < len; i++)
			if(R[i].b < maxx)
				A[u].push_back(R[i]), maxx = R[i].b;
}

void Dfs(int u, int father)
{
		size[u] = 1;
		int pd = 0;
		for(int e = first[u]; e; e = next[e])
		{
			int v = go[e];
			if(v == father) continue;
			fat[v] = u, dist[v] = w[e];
			Dfs(v, u);
			size[u] += size[v], pd++;
			if(pd == 2) Update(u);
		}
		if(!pd) A[u].push_back((power){0, 0});
}

int Check()
{
		for(int i = 1; i <= n; i++)
			A[i].clear();
		Dfs(1, 0);

	/*	for(int i = 1; i <= n; i++)
		{
			cout<<i<<":    "<<A[i].size()<<endl;
			for(int j = 0; j < A[i].size(); j++)
				cout<<A[i][j].a<<" "<<A[i][j].b<<endl;
			cout<<endl;
		}
*/
		return A[1].size() > 0;
}

int main()
{
		//freopen(".in","r",stdin);
		//freopen(".out","w",stdout);
		n = get();
		for(int i = 2; i <= n; i++)
		{
			x = get(), y = get();
			Add(i, x, y), r += y;
		}


		while(l < r - 1)
		{
			K = l + r >> 1;
			if(Check()) r = K;
			else l = K;
		}

		K = l;
		if(Check()) printf("%lld", l);
		else printf("%lld", r);
}

Measured memory_bytes: 70132