#include <bits/stdc++.h>

using namespace std;
const int nxm = 2e5 + 10;
int n;
vector<pair<int, long long >> g[nxm];
long long dist[nxm];
bool visited[nxm];
void findLongestPath(int u) {
	visited[u] = true;
	for (auto [v, w] : g[u]) {
		if (!visited[v]) {
			dist[v] = dist[u] + w;
			findLongestPath(v);
		}
	}
}
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	for (int i = 1; i < n; i++) {
		int u, v;
		long long w;
		cin >> u >> v >> w;
		g[u].emplace_back(v, w);
		g[v].emplace_back(u, w);
	}
	for (int i = 1; i <= n; i++) {
		dist[i] = -1e18;
	}
	int firstLongest = 2;
	dist[1] = 0;
	findLongestPath(2);
	for (int i = 1; i <= n; i++) {
		if (dist[i] > dist[firstLongest]) {
			firstLongest = i;
		}
	}
	for (int i = 1; i <= n; i++) {
		dist[i] = -1e18;
	}
	memset(visited, 0, sizeof(visited));
	dist[firstLongest] = 0;
	findLongestPath(firstLongest);
	int ans = firstLongest;
	for (int i = 1; i <= n; i++) {
		if (dist[i] > dist[ans]) {
			ans = i;
		}
	}
	cout << dist[ans] << '\n';
	return 0;
}