#include<iostream>
#include<cstdio>
#include<iomanip>
#include<cmath>
#include<algorithm>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
using namespace std;
long long fl[100001],n,sum,v2,n1,th,mx,brh,ans[100001],l[1000001],mxx;
vector < pair<long long,long long> > v[100001];
pair <long long,long long> h[100005],p;
void rec(long long vr1){
	int i,vr2;
	fl[vr1]=1;
	for(i=0;i<v[vr1].size();i++){
		vr2=v[vr1][i].second;
		if(fl[vr2]==0){
			ans[vr2]=ans[vr1]+v[vr1][i].first;
			rec(vr2);
		}
	}
}
int main(){
int i,j;
freopen("famtree.in","rt",stdin);
freopen("famtree.out","wt",stdout);
cin>>n;
for(i=1;i<n;i++){
	scanf("%lld %lld %lld",&p.second,&v2,&p.first);
	sum+=p.second;
	v[v2].push_back(p);
	//ans[i].second=i;//nomera mu
}
n1=(n*(n+1)/2)-sum;
rec(n1);
/*cout<<n1<<endl;
for(i=1;i<=n;i++){
	cout<<ans[i]<<endl;
}*/
sort(ans+1,ans+n+1);
//for(i=1;i<=n;i++)cout<<ans[i]<<" "; cout<<endl;
//for(i=1;i<=n;i++)cin>>ans[i];
th=0;
brh=0;
ans[0]=-1000;
for(i=1;i<=n;i++){
	if(ans[i]/1000==ans[i-1]/1000){
		//sashtoto hil
		h[brh].first++;
	}
	else{
		h[++brh].second=ans[i]/1000;
		h[brh].first=1;
	}
	//cout<<"hil "<<ans[i]/1000+1<<endl;
}
h[0].first=0;
h[0].second=-2;
for(i=1;i<=brh;i++){
	if(i!=1 && (h[i].first>h[i-1].first || h[i].second-1>h[i-1].second) && (h[i].first>h[i+1].first || h[i].second+1<h[i+1].second)){
		cout<<h[i].second<<" ";
	}
}
//cout<<endl;
return 0;
}
/*
6 4 
1 2
1 3
2 4
2 5
3 6
5 1
4 6
5 3
4 5


8
0 1 10
0 2 13
2 5 27
2 3 5
2 4 8
3 6 4
3 7 1
5
3 4 5
1 0 7
1 5 4
1 7 4
0 3 7
*/