#include <iostream>
#include <vector>
#include <climits>

using namespace std;
void dfs(int &A,int v,vector<vector<pair<int,long long>>> &adj,vector<bool> &visited,vector<long long> &dist)
{
    for(auto to:adj[v])
    {
        if(!visited[to.first])
        {
            dist[to.first]=dist[v]+to.second;
            if(dist[to.first]>dist[A])
            {
                A=to.first;
            }
            visited[to.first]=true;
            dfs(A,to.first,adj,visited,dist);
        }
    }

}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin>>n;
    vector<vector<pair<int,long long>>> adj(n+1);
    for(int i=1; i<n; i++)
    {
        int a,b,c;
        cin>>a>>b>>c;
        adj[a].push_back({b,c});
        adj[b].push_back({a,c});
    }
    vector<bool> visited(n+1,false);
    vector<long long> dist(n+1,0);
    visited[1]=true;
    int A=1,B=1;
    dfs(A,1,adj,visited,dist);
    visited.assign(n+1,false);
    dist.assign(n+1, 0);
    visited[A]=true;
    dfs(B,A,adj,visited,dist);
    vector<long long> distB(n+1,0);
    visited.assign(n+1,false);
    visited[B]=true;
    dfs(A,B,adj,visited,distB);
    long long mini=LLONG_MAX;
    vector<long long> tavok(n+1);
    for(int i=1; i<=n; i++)
    {
        tavok[i]=max(dist[i],distB[i]);
        mini = min(mini,tavok[i]);
    }
    cout<<mini<<endl;
    vector<long long> res;
    for(int i=1; i<=n; i++)
    {
        if(tavok[i]==mini)
            res.push_back(i);
    }
    cout<<res.size()<<endl;
    for(auto x:res)
        cout<<x<<" ";
    return 0;
}