#include<bits/stdc++.h>
#define For(i,x,y) for (int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (int i=(x);i<(y);i++)
#define Dow(i,x,y) for (int i=(x);i>=(y);i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef pair<int,int> pa;

inline ll read(){
    ll x;
    scanf("%lld",&x);
    return x;
}

const int N = 1010;
int n,ans2[N];
pa e[N],ee[N];
set<pa>e1[N],e2[N];

int col[N];
inline void dfs(int u,int fa,int c){
    col[u]=c;
    for (auto [v,id]:e1[u]) if (v!=fa){
        dfs(v,u,c);
    }
}

int fa[N],fid[N];
inline void Dfs(int u){
    for (auto [v,id]:e2[u]) if (v!=fa[u]){
        fa[v]=u,fid[v]=id;
        Dfs(v);
    }
}

int main(){
    n=read();
    For(i,1,n-1){
        int x=read(),y=read();
        e1[x].insert(mp(y,i));
        e1[y].insert(mp(x,i));
        e[i]=mp(x,y);
    }
    For(i,1,n-1){
        int x=read(),y=read();
        e2[x].insert(mp(y,i));
        e2[y].insert(mp(x,i));
        ee[i]=mp(x,y);
    }
    For(i,1,n-1){
        auto [x,y]=e[i];
        dfs(x,y,0);
        dfs(y,x,1);
        bool flag=0;
        fa[x]=0,fid[x]=0,Dfs(x);
        for (int u=y;u;u=fa[u]){
            int v=fa[u];
            if (v){
                if (col[u]!=col[v]&&fid[u]>0){
                    flag=1;
                    ans2[i]=fid[u];
                    break;
                }
            }
        }
        assert(flag);
        e1[x].erase(mp(y,i));
        e1[y].erase(mp(x,i));
        e2[x].insert(mp(y,-i));
        e2[y].insert(mp(x,-i));
        auto [x2,y2]=ee[ans2[i]];
        e2[x2].erase(mp(y2,ans2[i]));
        e2[y2].erase(mp(x2,ans2[i]));
        e1[x2].insert(mp(y2,-ans2[i]));
        e1[y2].insert(mp(x2,-ans2[i]));
        //printf("%d %d\n",i,ans2[i]);
    }
    For(i,1,n-1) printf("%d ",i); 
    puts("");
    For(i,1,n-1) printf("%d ",ans2[i]);
    puts("");
}