# include <bits/stdc++.h>
using namespace std;
vector <pair <int, int> > g[10005];
int br[100005],hil[100005],ans[100005];
void dfs(int v)
{
   // cout<<v<<endl;
    int i,j;
    long long k;
    for(i=0;i<g[v].size();i++)
    {
        k=  hil[v]+g[v][i].second;
        hil[g[v][i].first]=k;
        ans[k/1000]++;
        dfs(g[v][i].first);
    }
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
  freopen ("famtree.in","r",stdin);  freopen ("famtree.out","w",stdout);
int i,j,x,y,p;
int n;
cin>>n;
for(i=1;i<n;i++)
{//cout<<"OK"<<endl;
    cin>>y>>x>>p;
    g[x].push_back({y,p});
    br[y]++;
}
//cout<<"P"<<endl;
int v;
for(i=1;i<=n;i++)
{
    if(br[i]==0){v=i;break;}
}
hil[v]=0;
ans[0]++;
dfs(v);
for(i=1;i<=100000;i++)
{
   // cout<<i<<" "<<ans[i]<<endl;
    if(ans[i]>ans[i-1]&&ans[i]>ans[i+1])
    {
        cout<<i<<" ";

    }
}
cout<<endl;
return 0;
}