#include <bits/stdc++.h>
#define speed ios::sync_with_stdio(0);cin.tie(0)
using namespace std;
typedef long long ll;

vector<vector<pair<int, ll>>> g;
vector<ll> dist;
vector<int> par;

void dfs(int u) {
    for (auto [v, w] : g[u]) {
        if (dist[v] != -1) continue;
        dist[v] = dist[u] + w;
        par[v] = u;
        dfs(v);
    }
}

int main() {
    speed;
    int n;
    cin >> n;
    g.resize(n + 1);
    for (int i = 0; i < n - 1; i++) {
        int u, v; ll w;
        cin >> u >> v >> w;
        g[u].push_back({ v,w });
        g[v].push_back({ u,w });
    }
    par.assign(n + 1, -1);
    dist.assign(n + 1, -1);
    dist[1] = 0;
    dfs(1);
    int s = max_element(dist.begin() + 1, dist.end()) - dist.begin();
    par.assign(n + 1, -1);
    dist.assign(n + 1, -1);
    dist[s] = 0;
    dfs(s);
    int e = max_element(dist.begin() + 1, dist.end()) - dist.begin();
    ll diam = dist[e];
    int curr = e;
    map<ll, vector<int>> distLists;
    while (curr != -1) {
        ll currDistS = dist[curr];
        ll currDistE = diam - currDistS;
        distLists[max(currDistS, currDistE)].push_back(curr);
        curr = par[curr];
    }
    auto& [d, l] = *distLists.begin();
    sort(l.begin(), l.end());
    cout << d << '\n' << l.size() << '\n';
    for (auto a : l) cout << a << ' ';
}