#include<bits/stdc++.h>
using namespace std;
const int N=2005;
int n,deg1[N],deg2[N],ans1[N],ans2[N];
bool vis[N],bo[N];
map<int,int>mp1[N],mp2[N];
inline void dfs1(int x,int fa){
	bo[x]=1;
	auto it=mp1[x].begin();
	while(it!=mp1[x].end()){
		int y=(*it).first;
		if(y!=fa)dfs1(y,x);
		++it;
	}
}
inline void dfs2(int x,int fa){
	bo[x]=1;
	auto it=mp2[x].begin();
	while(it!=mp2[x].end()){
		int y=(*it).first;
		if(y!=fa)dfs2(y,x);
		++it;
	}
}
int main(){
	scanf("%d",&n);
	int x,y;
	for(int i=1;i<n;++i){
		scanf("%d%d",&x,&y);
		mp1[x][y]=mp1[y][x]=i;
		++deg1[x],++deg1[y];
	}
	for(int i=1;i<n;++i){
		scanf("%d%d",&x,&y);
		mp2[x][y]=mp2[y][x]=i;
		++deg2[x],++deg2[y];
	}
	for(int t=1;t<n;++t){
		x=1;
		while(vis[x]||deg1[x]+deg2[x]>3)++x;
		vis[x]=1;
		if(deg1[x]+deg2[x]==2){
			auto i1=mp1[x].begin();
			y=(*i1).first;
			mp1[y].erase(x);
			--deg1[y];
			ans1[t]=(*i1).second;
			auto i2=mp2[x].begin();
			y=(*i2).first;
			mp2[y].erase(x);
			--deg2[y];
			ans2[t]=(*i2).second;
		}
		else{
			if(deg1[x]==1){
				auto i1=mp1[x].begin();
				int a=(*i1).first;
				mp1[a].erase(x);
				--deg1[a];
				ans1[t]=(*i1).second;
				auto i2=mp2[x].begin();
				int b=(*i2).first,B=(*i2).second;
				++i2;
				int c=(*i2).first,C=(*i2).second;
				mp2[b].erase(x),mp2[c].erase(x);
				memset(bo,0,sizeof(bo));
				dfs2(b,x);
				if(bo[a]){
					ans2[t]=B;
					mp2[b][c]=mp2[c][b]=C;
				}
				else{
					ans2[t]=C;
					mp2[b][c]=mp2[c][b]=B;
				}
			}
			else{
				auto i2=mp2[x].begin();
				int a=(*i2).first;
				mp2[a].erase(x);
				--deg2[a];
				ans2[t]=(*i2).second;
				auto i1=mp1[x].begin();
				int b=(*i1).first,B=(*i1).second;
				++i1;
				int c=(*i1).first,C=(*i1).second;
				mp1[b].erase(x),mp1[c].erase(x);
				memset(bo,0,sizeof(bo));
				dfs1(b,x);
				if(bo[a]){
					ans1[t]=B;
					mp1[b][c]=mp1[c][b]=C;
				}
				else{
					ans1[t]=C;
					mp1[b][c]=mp1[c][b]=B;
				}
			}
		}
	}
	for(int i=1;i<n;++i)printf("%d ",ans1[i]);
	printf("\n");
	for(int i=1;i<n;++i)printf("%d ",ans2[i]);
}