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

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int

using namespace __gnu_pbds;

typedef tree<pair<ll,pair<ll,ll> >, null_type, less<pair<ll,pair<ll,ll> > >, rb_tree_tag, tree_order_statistics_node_update>ordered_set;


#define me BOSS
#define bug() cout<<"AIkahne aise"<<endl
#define PI acos(-1)
#define mod 1000000007
/* Precode Start Here *\


power of 2 less than or equal to N

ll largest_power(ll N)
{
    //changing all right side bits to 1.
    N = N (N>>1);
    N = N| (N>>2);
    N = N| (N>>4);
    N = N| (N>>8);


//as now the number is 2 * x-1, where x is required answer, so adding 1 and dividing it by
 2.
            return (N+1)>>1;

}


     Sieve
void sieve()
{
    for(ll i=3; i<=2000; i+=2)
    {
        for(ll j=i*i; j<=4000000; j+=i)
            A[j]=1;
    }
    v.push_back(2);
    for(ll i=3; i<=4000000; i+=2)
        if(A[i]==0)
            v.push_back(i);
}

     Power Function Modulo P

ll modPow(ll a, ll x, ll p) {
    //calculates a^x mod p in logarithmic time.
    long res = 1;
    while(x > 0) {
        if( x % 2 != 0) {
            res = (res * a) % p;
        }
        a = (a * a) % p;
        x /= 2;
    }
    return res;
}


   factorial

ll fact(ll n)
{
    ll ans=1;
    for(ll i=1;i<=n;i++)
    {
        ans=(ans*i)%mod;
    }
    return ans;
}
     Calculating nCr using Fermats law Theorem

ll modInverse(ll a, ll p) {
    //calculates the modular multiplicative of a mod m.
    //(assuming p is prime).
    return modPow(a, p-2, p);
}


ll modBinomial(ll n, ll k, ll p) {
// calculates C(n,k) mod p (assuming p is prime).

    ll numerator = 1; // n * (n-1) * ... * (n-k+1)
    for (ll i=0; i<k; i++) {
        numerator = (numerator * (n-i) ) % p;
    }

    ll denominator = 1; // k!
    for (ll i=1; i<=k; i++) {
        denominator = (denominator * i) % p;
    }

    // numerator / denominator mod p.
    return ( numerator* modInverse(denominator,p) ) % p;
}
     num of divisor and euler totient

ll phi[1000001],mark[1000001],divi[1000001];;
void divisorPhi(ll n)
{
    for(int i=1;i<=n;i++)
        phi[i]=i;
    for(int i=2;i<=n;i++)
    {
        if(!mark[i])
        {
            for(int j=i;j<=n;j+=i)
            {
                mark[j]=1;
                phi[j]*=(1-1/(double)i);
            }
        }
    }
    for(ll i=1;i<=n;i++)
    {
        for(ll j=i;j<=n;j+=i)
            divi[j]++;
    }
}




/* Precode Ends */
ll vis[500001],deep[500001],disa[300001],disb[300001];
vector<ll>v[300001];
map<ll,ll>myMap;
set<ll>mySet;
vector<pair<ll,ll> >vp;
void getdisv(ll start,ll cnt)
{
    vis[start]=1;
    for(int i=0; i<v[start].size(); i++)
    {
        ll u=v[start][i];
        if(vis[u]==0)
        {
            disb[u]=cnt;
            getdisv(u,cnt+1);
        }
    }
}
void getdisu(ll start,ll cnt)
{
    vis[start]=1;
    for(int i=0; i<v[start].size(); i++)
    {
        ll u=v[start][i];
        if(vis[u]==0)
        {
            disa[u]=cnt;
            getdisu(u,cnt+1);
        }
    }
}
void depth(ll start)
{
    vis[start]=1;
    for(int i=0; i<v[start].size(); i++)
    {
        ll u=v[start][i];
        if(vis[u]==0)
        {
            depth(u);
            deep[start]=max(deep[start],deep[u]+1);
        }
    }
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll n,taka,aoki,a,b,ans=0;
    cin>>n>>taka>>aoki;
    for(int i=0; i<n-1; i++)
    {
        cin>>a>>b;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    depth(1);
    memset(vis,0,sizeof(vis));
    getdisu(taka,1);
    memset(vis,0,sizeof(vis));
    getdisv(aoki,1);
    for(int i=1;i<=n;i++)
    {
       // cout<<i<<" "<<deep[i]<<" "<<disa[i]<<" "<<disb[i]<<endl;
       if(disa[i]<disb[i])
       {
           ans=max(ans,disb[i]-1);
       }
    }
    cout<<ans<<endl;
    return 0;
}



Measured memory_bytes: 27136