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

void dfs(int v, int p,
         const vector<vector<pair<int,long long>>> &adj,
         vector<long long> &dist,
         int &far)
{
    for (auto [to, w] : adj[v]) {
        if (to == p) continue;
        dist[to] = dist[v] + w;
        if (dist[to] > dist[far]) far = to;
        dfs(to, v, adj, dist, far);
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;

    vector<vector<pair<int,long long>>> adj(n + 1);
    for (int i = 1; i < n; i++) {
        int a, b;
        long long c;
        cin >> a >> b >> c;
        adj[a].push_back({b, c});
        adj[b].push_back({a, c});
    }

    // 1) 1-ből -> A
    vector<long long> dist(n + 1, 0);
    int A = 1;
    dfs(1, 0, adj, dist, A);

    // 2) A-ból -> B és közben distA
    vector<long long> distA(n + 1, 0);
    int B = A;
    dfs(A, 0, adj, distA, B);

    // 3) B-ből -> distB
    vector<long long> distB(n + 1, 0);
    int dummy = B; // csak hogy a dfs-nek legyen far paramétere, nem érdekes
    dfs(B, 0, adj, distB, dummy);

    // 4) ecc(v) = max(distA[v], distB[v]) minimuma adja T-t és a középpontokat
    long long T = LLONG_MAX;
    vector<int> centers;

    for (int i = 1; i <= n; i++) {
        long long ecc = max(distA[i], distB[i]);
        if (ecc < T) {
            T = ecc;
            centers.clear();
            centers.push_back(i);
        } else if (ecc == T) {
            centers.push_back(i);
        }
    }

    cout << T << "\n";
    cout << centers.size() << "\n";
    for (int x : centers) cout << x << " ";
    cout << "\n";
    return 0;
}