#include <iostream>
#include <vector>
#include <queue>
#include <cstdio>
using namespace std;

vector<int> v[10001];
vector<int>::iterator it;
int n,god[10001],st,h[10001];
bool f[10001];
int main()
{
int i;
     freopen("famtree.in","rt",stdin);
     freopen("famtree.out","wt",stdout);
    cin>>n;
    int a,b,y;
    for(i=1;i<n;i++){
        cin>>a>>b>>y;
        v[b].push_back(a);
        god[a]=y;
        f[a]=1;
    }
     bool fl[10001];
    queue<int> q;
    //cout<<f[3]<<endl;
    for(i=1;i<=n;i++)if(f[i] == 0){st=i; q.push(st); break;}
    fl[st]=1;
   // cout<<q.size()<<endl;
    while(!q.empty()){
        int fr = q.front();
        //cout<<fr<<" ";
        for(it = v[fr].begin();it != v[fr].end(); ++it){
            if(fl[*it] == 0){q.push(*it); fl[*it]=1; god[*it]+=god[fr]; /*cout<<*it<<" "<<god[*it]<<" "<<fr<<" "<<god[fr]<<endl;*/}
        }
        q.pop();
    }
    int maxx=0;
    for(i=1;i<=n;i++){
        h[god[i]/1000]++;// cout<<god[i]/1000<<" ";
        if(maxx < god[i]/1000)maxx=god[i]/1000;
    }

    for(i=1;i<maxx;i++){
        if(h[i] > h[i-1] && h[i] > h[i+1])cout<<i<<" ";
    }


   // cout<<endl;



    return 0;
}