#include <cstdio>
#include <cstring>
using namespace std;
const int N = 2e5;
int n;
int to[(N << 1) + 5],val[(N << 1) + 5],pre[(N << 1) + 5],first[N + 5];
inline void add(int u,int v,int w)
{
	static int tot = 0;
	to[tot] = v,val[tot] = w,pre[tot] = first[u],first[u] = tot++;
}
int fa[N + 5],las[N + 5];
long long dis[N + 5];
int q[N + 5],head,tail;
int bfs(int s)
{
	head = tail = 0,fa[q[++tail] = s] = dis[s] = 0;
	for(register int p;head < tail;)
	{
		p = q[++head];
		for(register int i = first[p];~i;i = pre[i])
			if(to[i] ^ fa[p])
				fa[to[i]] = p,las[to[i]] = i,dis[to[i]] = dis[p] + val[i],q[++tail] = to[i];
	}
	int ret = 0;
	for(register int i = 1;i <= n;++i)
		if(dis[i] > dis[ret])
			ret = i;
	return ret;
}
int s,p;
long long ans;
int main()
{
	memset(first,-1,sizeof first);
	scanf("%d",&n);
	int u,v,w;
	for(register int i = 2;i <= n;++i)
		scanf("%d%d%d",&u,&v,&w),add(u,v,w),add(v,u,w);
	ans = dis[p = bfs(s = bfs(1))];
	for(;p ^ s;p = fa[p])
		--val[las[p]],--val[las[p] ^ 1];
	printf("%lld\n%d\n",ans,ans - dis[bfs(bfs(1))]);
}