#include <bits/stdc++.h>
using namespace std;

int main() {
    static const int maxn = 50010, maxlg = 20;
    int t;
    scanf("%d", &t);
    while (t--) {
        int n, s, t;
        scanf("%d %d %d", &n, &s, &t);
        static vector<int> G[maxn];
        for (int i = 1; i <= n; i++) G[i].clear();
        for (int i = 1, u, v; i < n; i++) {
            scanf("%d %d", &u, &v);
            G[u].push_back(v);
            G[v].push_back(u);
        }
        bool flag = false;
        for (int i = 1; i <= n; i++) flag |= G[i].size() == n - 1;
        if (flag) {
            printf("%d ", s);
            for (int i = 2, x = 1; i < n; i++, x++) {
                while (x == s || x == t) x++;
                printf("%d ", x);
            }
            printf("%d\n", t);
            continue;
        }
        static int lg[maxn], dep[maxn];
        static int dfn[maxn], st[maxlg][maxn], cnt;
        static auto get = [](const int x, const int y) { return dep[x] < dep[y] ? x : y; };
        function<void(int, int)> dfs = [&dfs](const int u, const int fa) {
            st[0][dfn[u] = ++cnt] = fa;
            for (int i : G[u])
                if (i != fa)
                    dep[i] = dep[u] + 1, dfs(i, u);
            return;
        };
        cnt = 0, dfs(1, 0);
        for (int i = 2; i <= n; i++) lg[i] = lg[i >> 1] + 1;
        for (int l = 1; l <= lg[n]; l++)
            for (int i = 1; i + (1 << l) - 1 <= n; i++)
                st[l][i] = get(st[l - 1][i], st[l - 1][i + (1 << (l - 1))]);
        auto dist = [](int u, int v) {
            int ret = dep[u] + dep[v];
            u = dfn[u], v = dfn[v];
            if (u > v)
                swap(u, v);
            int Lg = lg[v - (++u) + 1];
            return ret - (dep[get(st[Lg][u], st[Lg][v - (1 << Lg) + 1])] << 1);
        };
        static int ans[maxn];
        if (n <= 9) {
            static int p[maxn], mi;
            function<void(int, int)> dfs = [&dfs, n, s, t, dist](const int i, const int val) {
                static bool vis[maxn];
                if (i == n) {
                    if (mi > (val ^ dist(p[i - 1], p[i])))
                        memcpy(ans, p, sizeof(int) * (n + 5)), mi = val ^ dist(p[i - 1], p[i]);
                    return;
                }
                for (int x = 1; x <= n && mi >= 2; x++)
                    if (!vis[x] && x != s && x != t)
                        vis[p[i] = x] = true, dfs(i + 1, val ^ dist(p[i - 1], p[i])), vis[x] = false;
                return;
            };
            mi = n << 1, p[1] = s, p[n] = t, dfs(2, 0);
            for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
            printf("\n");
            continue;
        }
        static int p[maxn], val;
        p[1] = s, p[n] = t, val = 0;
        for (int i = 2, x = 1; i < n; i++, x++) {
            while (x == s || x == t) x++;
            p[i] = x;
        }
        static random_device rd;
        static mt19937 rng(rd());
        shuffle(p + 2, p + n, rng);
        for (int i = 1; i < n; i++) val ^= dist(p[i], p[i + 1]);
        while (true) {
            int x, y;
            do x = rng() % (n - 2) + 2, y = rng() % (n - 2) + 2;
            while (x == y);
            if (x > y)
                swap(x, y);
            val ^= dist(p[x - 1], p[x]) ^ dist(p[x], p[x + 1]);
            val ^= (x + 1 == y ? 0 : dist(p[y - 1], p[y])) ^ dist(p[y], p[y + 1]);
            swap(p[x], p[y]);
            val ^= dist(p[x - 1], p[x]) ^ dist(p[x], p[x + 1]);
            val ^= (x + 1 == y ? 0 : dist(p[y - 1], p[y])) ^ dist(p[y], p[y + 1]);
            if (val < 2) {
                memcpy(ans, p, sizeof(int) * (n + 5));
                break;
            }
        }
        for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
        printf("\n");
    }
    return 0;
}