#include <bits/stdc++.h>

using namespace std;
const int c=100005;
int n;
long long tav[c], tavid[c];
vector<pair<int, long long> > el[c];
vector<pair<long long, int> > max_tav[c];
bool volt[c], volt2[c];
void dfs(int a) {
    volt[a]=true;
    max_tav[a].push_back({0, a});
    for (auto p:el[a]) {
        int x=p.first;
        long long y=p.second;
        if (!volt[x]) {
            dfs(x);
            max_tav[a].push_back({max_tav[x][0].first+y, max_tav[x][0].second});
            sort(max_tav[a].rbegin(), max_tav[a].rend());
            if (max_tav[a].size()>2) {
                max_tav[a].pop_back();
            }
        }
    }
}
void dfs2(int a) {
    volt2[a]=true;
    tav[a]=max_tav[a][0].first;
    tavid[a]=max_tav[a][0].second;
    for (auto p:el[a]) {
        int x=p.first;
        long long y=p.second;
        if (!volt2[x]) {
            if (tavid[a]!=max_tav[x][0].second) {
                max_tav[x].push_back({max_tav[a][0].first+y, max_tav[a][0].second});
            } else if (max_tav[a].size()>1) {
                max_tav[x].push_back({max_tav[a][1].first+y, max_tav[a][1].second});
            }
            sort(max_tav[x].rbegin(), max_tav[x].rend());
            dfs2(x);
        }
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin >> n;
    for (int i=1; i<n; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        el[a].push_back({b, c});
        el[b].push_back({a, c});
    }
    dfs(1);
    dfs2(1);
    long long ert=tav[1], cnt=0;
    for (int i=1; i<=n; i++) {
        if (tav[i]<ert) {
            ert=tav[i];
            cnt=0;
        }
        if (ert==tav[i]) {
            cnt++;
        }
    }
    cout << ert << "\n";
    cout << cnt << "\n";
    for (int i=1; i<=n; i++) {
        if (tav[i]==ert) {
            cout << i << " ";
        }
    }
    cout << "\n";
    return 0;
}