#include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define ll long long
using namespace std;

ll n;
vector<pair<ll,ll>> v[20000];
vector<pair<ll,ll>> p[20000];
vector<ll> res;
map<ll,ll> m;

void dfs(ll x,ll pre,ll god)
{
    ll mil=god/1000LL;
    m[mil]++;
    for(auto i:v[x]){
        if(i.first==pre)continue;
        dfs(i.first,x,god+i.second);
    }
    return;
}

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

    freopen("famtree.in","r",stdin);
    freopen("famtree.out","w",stdout);

    cin >> n;

    for(int i=1;i<n;i++){
        ll a,b,c;
        cin >> a >> b >> c;
        p[a].pb({b,c});
        v[b].pb({a,c});
    }
    ll koren=0;
    for(int i=1;i<=n;i++){
        if(p[i].size()==0){
            koren=i;
            break;
        }
    }
    //cout << koren;
    //return 0;
    dfs(koren,0,0);
    for(auto i:m){
        //cout << i.first << ' ' << i.second << endl;
        if(m[i.first-1]<i.second && i.first-1>0 && m[i.first+1]<i.second){
            res.pb(i.first);
        }
    }
    if(res.size()==0)return 1;
    sort(res.begin(),res.end());
    for(int i=0;i<res.size();i++){
        if(res.size()-1!=i)cout << res[i] << ' ';
        else cout << res[i];
    }
    return 0;
}