/**
 *    author:  MaGnsi0
 *    created: 07.10.2023 12:42:52
**/
#include <bits/stdc++.h>

using namespace std;

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int T;
    cin >> T;
    while (T--) {
        int n, s, m;
        cin >> n >> s >> m;
        vector<vector<int>> adj(n);
        for (int i = 0; i < n - 1; ++i) {
            int u, v;
            cin >> u >> v;
            adj[u - 1].push_back(v - 1);
            adj[v - 1].push_back(u - 1);
        }
        vector<bool> on_path(n, false), m_sup(n, false);
        vector<int64_t> dm(n, 0), ds(n, 0), par(n, -1);
        function<void(int, int, bool)> dfs1 = [&](int v, int p, bool x) {
            bool y = x || (v == m - 1);
            if (y) { m_sup[v] = true; }
            for (int u : adj[v]) {
                if (u == p) { continue; }
                par[u] = v;
                ds[u] = ds[v] + 1;
                dfs1(u, v, y);
            }
        };
        dfs1(s - 1, -1, false);
        function<void(int, int)> dfs2 = [&](int v, int p) {
            for (int u : adj[v]) {
                if (u == p) { continue; }
                dm[u] = dm[v] + 1;
                dfs2(u, v);
            }
        };
        dfs2(m - 1, -1);
        for (int u = m - 1; u != -1; u = par[u]) {
            on_path[u] = true;
        }
        vector<int> I(n);
        iota(I.begin(), I.end(), 0);
        sort(I.begin(), I.end(), [&](int i, int j) {
                return dm[i] > dm[j];
            });
        int64_t ans = INT_MAX, x = 0;
        set<int> picked;
        multiset<int64_t> not_picked;
        for (int i = 0; i < n; ++i) {
            if (!on_path[i] && !m_sup[i]) {
                not_picked.insert(dm[i]);
                ans = max(ans, ds[m - 1] + dm[i]);
            } else {
                ans = max(ans, ds[i]);
            }
        }
        for (int v : I) {
            if (m_sup[v]) { break; }
            while (!picked.count(v) && !on_path[v]) {
                picked.insert(v);
                not_picked.erase(not_picked.find(dm[v]));
                x = max(x, dm[v] - ds[v]); 
                v = par[v];
            }
            ans = min(ans, ds[m - 1] + x + (not_picked.empty() ? 0 : *not_picked.rbegin()) + 2 * (int64_t)picked.size());
        }
        cout << ans << "\n";
    }
}