#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(nullptr);
    auto sr = [](long long a, long long b) {return make_pair(min(a,b), max(a,b));};

    long long n;
    cin >> n;
    vector<unordered_set<long long>> szom(n+1);
    map<pair<long long,long long>,long long> edge;
    for(long long i = 0; i < n-1; i++) {
        long long a, b, c;
        cin >> a >> b >> c;
        szom[a].insert(b);
        szom[b].insert(a);
        edge[sr(a,b)] = c;
    }

    unordered_set<long long> level, volt;
    long long gyok = -1;
    for(long long i = 1; i <= n; i++) {
        if(szom[i].size() == 1) level.insert(i);
        else if(gyok == -1) gyok = i;
    }

    vector<long long> apa(n+1, 0);
    vector<unordered_set<long long>> fia(n+1);
    queue<long long> sor;

    sor.push(gyok);
    volt.insert(gyok);
    while(sor.size() > 0) {
        for(auto i : szom[sor.front()]) {
            if(!volt.count(i)) {
                apa[i] = sor.front();
                fia[sor.front()].insert(i);
                volt.insert(i);
                sor.push(i);
            }
        }
        sor.pop();
    }

    volt.clear();
    vector<set<long long>> alatt(n+1);
    for(auto i : level) {
        alatt[i].insert(0);
        sor.push(i);
        volt.insert(i);
    }

    while(sor.size() > 0) {
        alatt[apa[sor.front()]].insert(*--alatt[sor.front()].end() + edge[sr(sor.front(), apa[sor.front()])]);
        if(apa[sor.front()] != 0 && !volt.count(apa[sor.front()])) {
            sor.push(apa[sor.front()]);
            volt.insert(apa[sor.front()]);
        }
        sor.pop();
    }

    vector<long long> felett(n+1, 0);
    sor.push(gyok);
    while(sor.size() > 0) {
        for(auto i : fia[sor.front()]) {
            if(fia[sor.front()].size() > 1) {
                long long save = *--alatt[i].end() + edge[sr(i, sor.front())];
                alatt[sor.front()].erase(save);
                felett[i] = edge[sr(i, sor.front())] + max(felett[sor.front()], *--alatt[sor.front()].end());
                alatt[sor.front()].insert(save);
            } else {
                felett[i] = edge[sr(i, sor.front())] + felett[sor.front()];
            }
            if(!level.count(i)) sor.push(i);
        }
        sor.pop();
    }

    long long lk = LLONG_MAX;
    for(long long i = 1; i <= n; i++) lk = min(lk, max(*--alatt[i].end(), felett[i]));
    set<long long> ki;
    for(long long i = 1; i <= n; i++) if(max(*--alatt[i].end(), felett[i]) == lk) ki.insert(i);

    cout << lk << '\n' << ki.size() << '\n';
    for(auto i : ki) cout << i << ' ';

	return 0;
}