#include <iostream>
#include <queue>
#include <climits>
#include <set>
#include <algorithm>
#define ll long long

using namespace std;

struct adat
{
    bool lat = false;
    ll kolt = INT_MAX;
    vector < pair <ll, ll> > sz;
};
vector <adat> x;

struct adatt
{
    ll hova, hossz;
};
priority_queue <adatt> t;

bool operator < (const adatt& a, const adatt& b)
{
    return a.hossz > b.hossz;
}

void dijkstra(ll csp)
{
    t.push({ csp, 0 });
    x[csp].kolt = 0;
    adatt akt;
    while (!t.empty())
    {
        akt = t.top();
        t.pop();
        for (auto& e : x[akt.hova].sz)
        {
            if (x[e.first].kolt > e.second + akt.hossz)
            {
                x[e.first].kolt = e.second + akt.hossz;
                t.push({ e.first, x[e.first].kolt });
            }
        }
    }
}

int main()
{
    ll n;
    cin >> n;
    x.resize(n+1);
    for (ll i = 1; i <= n - 1; ++i)
    {
        ll cs1, cs2, kolt;
        cin >> cs1 >> cs2 >> kolt;
        x[cs1].sz.push_back({ cs2, kolt });
        x[cs2].sz.push_back({ cs1, kolt });
    }
    ll maxi = INT_MIN;
    set <ll> poz;
    for (ll i = 1; i <= n; ++i)
    {
        if (x[i].sz.size() == n - 1)
        {
            dijkstra(i);
            for (ll j = 1; j <= n; ++j)
            {
                maxi = max(maxi, x[j].kolt);
            }
            poz.insert(i);
        }
    }
    cout << maxi << "\n" << poz.size() << "\n";
    for (auto& e : poz)
        cout << e << " ";

    return 0;
}
/*
10
1 8 4
3 8 5
6 8 3
8 10 6
7 8 2
8 2 9
8 9 2
5 8 6
4 8 2
*/