#include <iostream>
#include <vector>
#include <climits>
#define ll long long
using namespace std;

struct adat
{
    vector<pair<ll, ll>> sz;
};

bool stop = false;
ll n, a, b, c, maxi = LLONG_MAX, helyi_max;
vector<adat> x;
vector<ll> sol;
vector<ll> st;

void melysegi(ll akt, ll honnan)
{
    for (auto &e : x[akt].sz)
    {
        if (stop)
            return;

        if (e.first != honnan)
        {
            st[e.first] = st[akt] + e.second;
            helyi_max = max(st[e.first], helyi_max);
            if (helyi_max > maxi)
            {
                stop = true;
                return;
            }
            else
            {
                melysegi(e.first, akt);
            }
        }
    }
}

int main()
{
    cin >> n;
    x.resize(n + 1);
    st.resize(n + 1);

    for (int i = 1; i < n; ++i)
    {
        cin >> a >> b >> c;
        x[a].sz.push_back({b, c});
        x[b].sz.push_back({a, c});
    }

    for (int i = 1; i <= n; ++i)
    {
        st[i] = 0;
        melysegi(i, 0);
        if (!stop)
        {
            if (helyi_max == maxi)
            {
                sol.push_back(i);
            }
            else if (helyi_max < maxi)
            {
                sol.clear();
                sol.push_back(i);
                maxi = helyi_max;
            }
        }
        helyi_max = 0;
        stop = false;
    }

    cout << maxi << endl;
    cout << sol.size() << endl;
    for (auto &e : sol)
    {
        cout << e << " ";
    }
}