#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
using namespace std;
struct Put
{
    long long v,d;
}t,t1;
vector <Put> v[10001];
long long i,j,p,q,n,m,k,parent,ans[1000001],max1;
long long s[1000001];
bool b[10001];
void dfs(long long u,long long d)
{
    ///dolniq red
    //cout<<u<<" "<<d<<endl;
    //if(d!=0 &&  d<1000)d=1000;
    ans[d/1000]++;
    if(d/1000>max1)max1=d/1000;
    for(int i=0;i<v[u].size();i++)
    {
        Put t = v[u][i];
        q = t.v;
        m = t.d+d;
        dfs(q,m);
    }
}
int main()
{
    freopen("famtree.in", "r", stdin);
    freopen("famtree.out", "w", stdout);
    cin>>n;
    for(i=1;i<n;i++)
    {
        scanf("%lld%lld%lld",&p,&q,&k);
        v[q].push_back({p,k});
        b[p]=1;
    }
    for(i=1;i<=n;i++)
    {
        if(!b[i])parent = i;
    }
    dfs(parent,0);
    q=0;
    for(i=1;i<=max1;i++)
    {
        if(ans[i]>ans[i-1] && ans[i]>ans[i+1])
        {
            printf("%lld ",i);
        }
    }
    return 0;
}
/**
6
5 2 2600
4 3 1200
2 3 1000
1 3 2500
6 3 6500
*/