#include <iostream>
#include <vector>

using namespace std;

long long n;
vector<pair<long long, long long>> adj[100001];
long long distan[2][100001];
long long current = 0;
long long previous[100001];
long long wprev[100001];
long long furthest1, furthest2;
long long maxdist = 0;

void dfs(long long x, long long p, long long dist){
    distan[current][x] = dist;
    if (dist > maxdist){
        maxdist = dist;
        furthest1 = x;
    }
    previous[x] = p;
    for (auto [next, w] : adj[x]){
        if (next != p){
            wprev[next] = w;
            dfs(next, x, dist + w);
        }
    }
}

int main(){
    //freopen("in.txt", "r", stdin);
    cin >> n;
    for (long long i = 0; i < n - 1; i++){
        long long a, b, w;
        cin >> a >> b >> w;
        adj[a].push_back({b, w});
        adj[b].push_back({a, w});
    }
    dfs(1, -1, 0);
    furthest2 = furthest1;
    dfs(furthest1, -1, 0);
    current = 1;
    dfs(furthest1, -1, 0);
    long long d = maxdist;
    long long x = furthest1;
    wprev[furthest2] = 0;
    /*while (true){
        if (x == furthest2){
            cout << maxdist << '\n' << 1 << '\n' << x << '\n';
            return 0;
        }
        if (maxdist % 2 == 0 && d == maxdist / 2){
            cout << maxdist / 2 << '\n' << 1 << '\n' << x << '\n';
            return 0;
        }
        if (d - wprev[x] < maxdist / 2.0){
            long long sol1 = x, sol2 = previous[x];
            long long val1 = max(d, maxdist - d);
            long long val2 = max(d + wprev[x], maxdist - d - wprev[x]);
            if (val1 == val2){
                cout << val1 << '\n' << 2 << '\n' << min(sol1, sol2) << '\n' << max(sol1, sol2) << '\n';
            }
            else{
                cout << min(val1, val2) << '\n' << 1 << '\n';
                if (val1 < val2){
                    cout << sol1 << '\n';
                }
                else{
                    cout << sol2 << '\n';
                }
            }
            return 0;
        }

        d -= wprev[x];
        x = previous[x];
    }*/
    long long ans = 1e18;
    for (int i = 1; i <= n; i++){
        ans = min(ans, max(distan[0][i], distan[1][i]));
    }
    vector<int> answers;
    for (int i = 1; i <= n; i++){
        if (max(distan[0][i], distan[1][i]) == ans){
            answers.push_back(i);
        }
    }
    cout << ans << '\n' << answers.size() << '\n';
    for (int x : answers){
        cout << x << '\n';
    }
}