#include <bits/stdc++.h>
using namespace std;
vector<pair<int,int>> g[100001];
int bfs(int x){
	vector<bool> seen;
	seen.resize(1000001, false);
	queue<int> q; 
	q.push(x);
	int mxtav=0; 
	int tav[100001];
	seen[x]=true;
	tav[x]=0;
	while (!q.empty()){
		int v=q.front();

		q.pop();
		seen[v]=true; 
		for (auto edge:g[v]){
			if (!seen[edge.first]){
				tav[edge.first]=tav[v]+edge.second;
				q.push(edge.first);
				mxtav=max(tav[edge.first], mxtav);
			}
		}
	}
	return mxtav; 

}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n;
	cin>>n;
	for (int i=1; i<n;i++){
		int x,y,c;
		cin>>x>>y>>c;
		g[x].push_back({y,c});
		g[y].push_back({x,c});
	}
	vector<int> mego;
	int ans=INT_MAX;
	for (int i=1; i<=n;i++){
		int v=bfs(i);
		if (v<ans){
			ans=v;
			mego.clear(); 
	}
		if (v==ans) mego.push_back(i);
	}
	cout<<ans<<endl<<mego.size()<<endl;
	for (int x:mego) cout<<x<<" ";

}