#include<bits/stdc++.h>

using namespace std;

#define pb push_back
const int maxi = 1e6+10;
vector<pair<int,int>> v[maxi];
vector<int> ans;
string s;
int n;
int a ,b , y;
int cnt[maxi];
int mil[maxi];

void read_data()
{
     freopen("famtree.in","r", stdin);

     scanf("%d",&n);

     for (int i=1;i<n;i++)
     {
         int a,b,y;
         scanf("%d%d%d",&a,&b,&y);
         v[b].pb({a,y});
         cnt[a]++;

     }
    fclose(stdin);
}

void print_data()
{
    freopen("famtree.out","w", stdout);

    for (auto i:ans)
        printf("%d ",i);
    fclose(stdout);
}

void dfs(int x, int pred, int year)
{
    mil[year/1000]++;
    for (auto i:v[x])
        dfs(i.first, x, year + i.second);
}

void solve()
{
    int root = 0;
   for (int i=1;i<=n;i++)
    if (!cnt[i]) root = i;


   dfs(root, 0, 0);

   for (int i=1;i<=120000;i++)
    if (mil[i]> mil[i-1] && mil[i]>mil[i+1]) ans.pb(i);
}

int main()
{
    read_data();
    solve();
    print_data();

}

// ko mi tebe uze Tamara,
//prodala si suze drugima
//nocima ja sanjam tvoje tragove
//kuda idu izgubljene devojke