#include <bits/stdc++.h>
#define For(i, a, b) for (int i = (a); i <= (b); ++i)
#define Rep(i, a, b) for (int i = (a); i >= (b); --i)
#define ll long long
//#define int long long
#define ull unsigned long long
#define SZ(x) ((int)((x).size()))
#define ALL(x) (x).begin(), (x).end()
using namespace std;
inline int read()
{
    char c = getchar();
    int x = 0;
    bool f = 0;
    for (; !isdigit(c); c = getchar())
        f ^= !(c ^ 45);
    for (; isdigit(c); c = getchar())
        x = (x << 1) + (x << 3) + (c ^ 48);
    if (f)
        x = -x;
    return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int, int> pii;
typedef vector<int> vi;

#define maxn 200005
#define inf 0x3f3f3f3f

int n, s, t, p[maxn];
vi e[maxn];

int fa[maxn], dep[maxn], sz[maxn];
int dfn[maxn], que[maxn], out[maxn], idx;
int st[20][maxn], lg[maxn];
int depmin(int u, int v) { return dep[u] < dep[v] ? u : v; }
void dfs(int u)
{
    dfn[u] = ++idx, que[idx] = u, sz[u] = 1;
    for (auto v : e[u])
    {
        if (v == fa[u])
            continue;
        fa[v] = u, dep[v] = dep[u] + 1;
        dfs(v), sz[u] += sz[v];
    }
    out[u] = idx;
}
void init()
{
    dfs(1);
    For(i, 2, n) st[0][i] = fa[que[i]], lg[i] = lg[i >> 1] + 1;
    For(j, 1, 19)
        For(i, 1, n - (1 << j) + 1)
            st[j][i] = depmin(st[j - 1][i], st[j - 1][i + (1 << (j - 1))]);
}
int lca(int u, int v)
{
    if (u == v)
        return u;
    if ((u = dfn[u]) > (v = dfn[v]))
        swap(u, v);
    ++u;
    int k = __lg(v - u + 1);
    return depmin(st[k][u], st[k][v - (1 << k) + 1]);
}
int dist(int u, int v)
{
    if (!u || !v)
        return -((!u) + (!v));
    return dep[u] + dep[v] - 2 * dep[lca(u, v)];
}

bool flower()
{
    For(i, 1, n) if (e[i].size() == n - 1) return 1;
    return 0;
}

namespace BR
{
    int d[205][205];
    int p[205], mn, p2[205];
    bool vis[205];
    void chk()
    {
        int res = 0;
        For(i, 1, n - 1) res ^= d[p[i]][p[i + 1]];
        if (res < mn)
        {
            mn = res;
            For(i, 1, n) p2[i] = p[i];
        }
    }
    void dfs(int u)
    {
        if (u == n)
        {
            chk();
            return;
        }
        For(i, 1, n) if (!vis[i])
        {
            if (d[i][p[u - 1]] > 4)
                continue;
            p[u] = i, vis[i] = 1;
            dfs(u + 1);
            vis[i] = 0;
        }
    }
    void work()
    {
        mn = inf;
        For(i, 1, n) For(j, 1, n) d[i][j] = dist(i, j);
        For(i, 1, n) vis[i] = 0;
        p[1] = s, p[n] = t, vis[s] = vis[t] = 1;
        dfs(2);
        For(i, 1, n) cout << p2[i] << " ";
        cout << "\n";
    }
}

mt19937_64 rnd(time(0));
int R(int l, int r)
{
    return rnd() % (r - l + 1) + l;
}

void work()
{
    n = read(), s = read(), t = read();
    For(i, 1, n) e[i].clear();
    idx = 0;
    For(i, 2, n)
    {
        int u = read(), v = read();
        e[u].pb(v), e[v].pb(u);
    }
    init();
    p[1] = s, p[n] = t;
    For(i, 1, n) if (i != s && i != t) p[i - (i > s) - (i > t) + 1] = i;
    int now = 0;
    For(i, 1, n - 1) now ^= dist(p[i], p[i + 1]);
    if (flower())
    {
        For(i, 1, n) cout << p[i] << " ";
        cout << "\n";
        return;
    }
    if (n <= 9)
    {
        BR::work();
        return;
    }
    auto calc = [&](int x)
    {
        return dist(p[x], p[x - 1]) ^ dist(p[x], p[x + 1]);
    };
    while (now > 1)
    {
        int x = R(2, n - 1), y = R(2, n - 1);
        while (x == y)
            y = R(2, n - 1);
        now ^= calc(x) ^ calc(y);
        swap(p[x], p[y]);
        now ^= calc(x) ^ calc(y);
    }
    For(i, 1, n) cout << p[i] << " ";
    cout << "\n";
}

signed main()
{
    int T = read();
    while (T--)
        work();
    return 0;
}