#include <bits/stdc++.h>
#define MAXN 100005
#define For(I,A,B) for(int I = (A), endi = (B); I <= endi; ++I)
#define foR(I,A,B) for(int I = (A), endi = (B); I >= endi; --I)
#define ForE(I,A) for(int I = head[A]; I; I = e[I].nxt)
using namespace std;
typedef long long _ll;
typedef unsigned int ui;

struct Edge { int to,nxt; } e[MAXN<<1];
int head[MAXN],tot;
void add_edge(int x,int y) { e[++tot] = (Edge){y,head[x]}; head[x] = tot; }

int T,mx,ans,n,m,s,u,v,dep[MAXN],sz[MAXN];
bool hasS[MAXN];
void dfs(int u, int pre, int flag)
{
    sz[u] = 1;
    if(u == s) flag = 1;
    hasS[u] = flag;
    ForE(i,u)
    {
        int v = e[i].to;
        if(v == pre) continue;
        dep[v] = dep[u] + 1;
        dfs(v,u,flag);
        if(hasS[v]) hasS[u] = 1;
        sz[u] += sz[v];
    }
}
void dfs2(int u, int pre)
{
    hasS[u] = 1;
    ForE(i,u)
    {
        int v = e[i].to;
        if(v == pre) continue;
        dfs2(v,u);
    }
}
void solve()
{
    cin >> n >> m >> s; mx = ans = 0;
    tot = 0; fill(head,head+n+1,0); 
    fill(hasS,hasS+n+1,0); fill(sz,sz+n+1,0); fill(dep,dep+n+1,0);
    For(i,1,n) cin >> u >> v, add_edge(u,v), add_edge(v,u);
    dfs(m,0,0);
    if(s != m)
    {
        ForE(i,m)
            if(hasS[e[i].to])
            {
                dfs2(e[i].to,m);
                ans += sz[e[i].to]<<1;
            }
        ans -= dep[s]+2;
    }
    For(i,1,n) 
        if(!hasS[i])
            mx = max(mx,dep[i]);
    cout << ans + mx << '\n';
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    cin >> T;
    while(T--) solve();
    return 0;
}