#include <bits/stdc++.h>
using namespace std;
mt19937 eng;
#define ll long long
const int inf = 998244353;

int dfn;
struct node
{
    int fa;
    int deep;
    int dfn;
    vector<int> son;
    int top;
    void clear()
    {
        this->deep = 0;
        this->dfn = 0;
        this->top = 0;
        this->fa = 0;
        this->son.clear();
    }
};
int st[20][1001000];
node tr[1000100];
int t;
int S, T;
int n;
int rnd(int l, int r)
{
    return l + (eng() % (r - l + 1));
}
int dfnmin(int x, int y)
{
    return tr[x].dfn < tr[y].dfn ? x : y;
}
void build(int x)
{
    tr[x].dfn = ++dfn;
    tr[x].deep = tr[tr[x].fa].deep + 1;

    st[0][tr[x].dfn] = tr[x].fa;
    for (int son : tr[x].son)
    {
        if (son != tr[x].fa)
        {
            tr[son].fa = x;
            build(son);
        }
    }
}
void init()
{
    for (int i = 1; i <= __lg(n); i++)
    {
        for (int ww = 1; ww <= n; ww++)
        {
            st[i][ww] = dfnmin(st[i - 1][ww], st[i - 1][ww + (1 << (i - 1))]);
        }
    }
}
int get_lca(int a, int b)
{
    if (a == b)
    {
        return a;
    }
    int u = tr[a].dfn, v = tr[b].dfn;
    if (u > v)
    {
        swap(u, v), swap(a, b);
    }
    int d = __lg(v - u);
    u++;
    int lca_ = dfnmin(st[d][u], st[d][v - (1 << d) + 1]);
    return tr[a].deep + tr[b].deep - (tr[lca_].deep * 2);
}
int ans_ = inf;
int p[1000000];
int had_u[1000000];
int check()
{
    int insid = 0;
    for (int ww = 2; ww <= n; ww++)
    {
        insid ^= get_lca(p[ww - 1], p[ww]);
    }
    return insid;
}
void dfs(int x)
{
    if (x == n - 1)
    {
        ans_ = min(ans_, check());
    }
    else
    {
        x++;
        for (int ww = 1; ww <= n; ww++)
        {
            if (had_u[ww] == 0)
            {
                p[x] = ww;
                had_u[ww] = 1;
                dfs(x);
                p[x] = 0;
                had_u[ww] = 0;
            }
        }
    }
}
bool con_tag = 1;
void dfs_ans(int x)
{
    if (x == n - 1)
    {
        if (ans_ == check())
        {
            for (int ww = 1; ww <= n; ww++)
            {
                cout << p[ww] << " ";
            }
            cout << endl;
            con_tag = 0;
        }
    }
    else
    {
        x++;
        for (int ww = 1; ww <= n; ww++)
        {
            while (con_tag == 0)
            {
                return;
            }
            if (had_u[ww] == 0)
            {
                p[x] = ww;
                had_u[ww] = 1;
                dfs_ans(x);
                p[x] = 0;
                had_u[ww] = 0;
            }
        }
    }
}
bool is_flower()
{
    for (int e = 1; e <= n; e++)
    {
        while (tr[e].son.size() == (n - 1) + (tr[e].fa ? 1 : 0))
        {
            return 1;
        }
    }
    return 0;
}

int main()
{
    // freopen("2.in","r",stdin);
    ios::sync_with_stdio(false);
    eng.seed(time(NULL));
    cin >> t;
    for (int ww = 1; ww <= t; ww++)
    {
        for (int i = 1; i <= n; i++)
        {
            tr[i].son.clear();
        }
        cin >> n >> S >> T;

        int a, b;
        for (int i = 1; i < n; i++)
        {
            cin >> a >> b;
            tr[a].son.emplace_back(b);
            tr[b].son.emplace_back(a);
        }
        // memset(st, 0, sizeof(st));
        dfn = 0;
        build(1);
        init();
        for (int i = 1; i <= n; i++)
        {
            if (i != S && i != T)
            {
                p[i - (i > S) - (i > T) + 1] = i;
            }
        }
        if (is_flower())
        {
            for (int ww = 1; ww <= n; ww++)
            {
                cout << p[ww] << " ";
            }
            cout << "\n";
            continue;
        }
        if (n <= 10)
        {
            ans_ = inf;
            p[1] = S;
            p[n] = T;
            had_u[S] = 1;
            had_u[T] = 1;
            dfs(1);
            con_tag = 1;
            // cout<<ans_<<"-\n";
            dfs_ans(1);
            had_u[T] = 0;
            had_u[S] = 0;
        }
        else
        {
            p[1] = S, p[n] = T;

            if (is_flower())
            {
                for (int ww = 1; ww <= n; ww++)
                {
                    cout << p[ww] << " ";
                }
                cout << "\n";
                continue;
            }
            int now_ = check();
            while (now_ > 1)
            {
                int a_ = rnd(2, n - 1), b_ = rnd(2, n - 1);
                while (a_ == b_)
                {
                    b_ = rnd(2, n - 1);
                }
                int rec_ = now_;
                now_ ^= get_lca(p[a_ - 1], p[a_]) ^ get_lca(p[a_], p[a_ + 1]) ^ get_lca(p[b_ - 1], p[b_]) ^ get_lca(p[b_], p[b_ + 1]);
                swap(p[a_], p[b_]);
                now_ ^= get_lca(p[a_ - 1], p[a_]) ^ get_lca(p[a_], p[a_ + 1]) ^ get_lca(p[b_ - 1], p[b_]) ^ get_lca(p[b_], p[b_ + 1]);
            }
            for (int ww = 1; ww <= n; ww++)
            {
                cout << p[ww] << " ";
            }
            cout << "\n";
        }
    }
    return 0;
}