#include <bits/stdc++.h>

using namespace std;

const int N = 5e4 + 5;

vector<int> G[N];
int p[N], D[N], dfn[N], mn[20][N];

void dfs(int x, int y = 0) {
    mn[0][dfn[x] = ++dfn[0]] = D[y];
    for (auto v : G[x]) if (v != y) D[v] = D[x] + 1, dfs(v, x);
}

int dis(int x, int y) {
    int z = D[x] + D[y];
    x = dfn[x], y = dfn[y];
    if (x > y) swap(x, y);
    int k = 31 - __builtin_clz(y - x++);
    return z - 2 * min(mn[k][x], mn[k][y - (1 << k) + 1]);
}

signed main() {
    int T; scanf("%d", &T);
    while (T--) {
        int n, s, t; scanf("%d%d%d", &n, &s, &t);
        for (int i = 1; i <= n; ++i) G[i].clear(), p[i] = i;
        for (int i = 1, x, y; i < n; ++i) {
            scanf("%d%d", &x, &y);
            G[x].push_back(y), G[y].push_back(x);
        }
        if (n == 2) {
            printf("%d %d\n", s, t);
            continue;
        }
        dfn[0] = 0, dfs(D[1] = 1);
        for (int i = 1; (1 << i) <= n; ++i) {
            for (int j = 1; j + (1 << i) - 1 <= n; ++j) {
                mn[i][j] = min(mn[i - 1][j], mn[i - 1][j + (1 << (i - 1))]);
            }
        }
        swap(p[1], p[s]), swap(p[n], p[(t == 1 ? s : t)]);
        mt19937 rnd;
        shuffle(p + 2, p + n, rnd);
        int S = 0;
        for (int i = 1; i < n; ++i) S ^= dis(p[i], p[i + 1]);
        int v = S;
        for (int i = 1; i <= 50 * n && S >= 2; ++i) {
            int a = rnd() % (n - 2) + 2, b = rnd() % (n - 2) + 2;
            S ^= dis(p[a - 1], p[a]) ^ dis(p[a], p[a + 1]) ^ dis(p[b - 1], p[b]) ^ dis(p[b], p[b + 1]);
            swap(p[a], p[b]);
            S ^= dis(p[a - 1], p[a]) ^ dis(p[a], p[a + 1]) ^ dis(p[b - 1], p[b]) ^ dis(p[b], p[b + 1]);
            v = min(v, S);
        }
        for (int i = 1; i <= 50 * n; ++i) {
            int a = rnd() % (n - 2) + 2, b = rnd() % (n - 2) + 2;
            S ^= dis(p[a - 1], p[a]) ^ dis(p[a], p[a + 1]) ^ dis(p[b - 1], p[b]) ^ dis(p[b], p[b + 1]);
            swap(p[a], p[b]);
            S ^= dis(p[a - 1], p[a]) ^ dis(p[a], p[a + 1]) ^ dis(p[b - 1], p[b]) ^ dis(p[b], p[b + 1]);
            if (S == v) {
                for (int j = 1; j <= n; ++j) printf("%d%c", p[j], " \n"[j == n]);
                break;
            }
        }
    }
    return 0;
}