#include<cstdio>
#include<cstring>
#include<vector>
using std::vector;
constexpr size_t MAX=(size_t)3e5+1;
int n,u,v;
bool vis[MAX];
vector<int> a[MAX],ans;
inline void init(){
	memset(vis,0,sizeof(vis));
	return;
}
inline void dfs(int x){
	vis[x]=1;
	ans.push_back(x);
	for(int i=0;i<a[x].size();++i){
		if(!vis[a[x][i]]) dfs(a[x][i]);
	}
	return;
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<n;++i){
		scanf("%d%d",&u,&v);
		a[u].push_back(v);
		a[v].push_back(u);
	}
	u=0;
	for(int i=1;i<=n;++i) if(a[i].size()==1) ++u;
	if(u>=n-1){
		puts("NO");
		return 0;
	}
	else puts("YES");
	for(int i=1;i<=n;++i) if(a[i].size()==1){
		for(int j=0;j<a[i].size();++j){
			if(a[a[i][j]].size()!=1) u=a[i][j];
		}
		for(int j=0;j<a[u].size();++j){
			if(a[a[u][j]].size()!=1) v=a[u][j];
		}
		break;
	}
	vis[u]=1;
	dfs(v);
	vis[u]=0;
	dfs(u);
	for(int i=0;i<ans.size();++i){
		printf("%d",ans[i]);
		if(i<ans.size()-1) putchar(' ');
	}
	return 0;
}