#include <bits/stdc++.h>
#define ll long long 
#define pii pair<int,int>
#define all(x) x.begin(),x.end()
#define mp make_pair
#define mt make_tuple
#define ull unsigned long long 
#define rand(l,r) uniform_int_distribution<int>(l,r)(rng)
const int inf=1039714778;
const int mod=1e9+7;
using namespace std;
mt19937 rng(chrono::steady_clock().now().time_since_epoch().count());
template <typename T> inline void chmin(T &x,const T &b) {x=min(x,b);}
template <typename T> inline void chmax(T &x,const T &b) {x=max(x,b);}
inline void chadd(int &x,int b) {x+=b-mod;x+=(x>>31) & mod;}

template <typename T>
ostream & operator << (ostream &cout,const vector<T> &v)
{
	cout<<'{';
	int fst=1;
	for(auto x:v)
	{
		if(fst) fst=0;
		else cout<<',';
		cout<<x;
	}
	cout<<'}';
	return cout;
}

template <typename T1,typename T2>
ostream & operator << (ostream &cout,const pair<T1,T2> &o)
{
	cout<<'('<<o.first<<','<<o.second<<')';
	return cout;
}

namespace FastIO
{
	int cursor=(1<<20);
	char buf[(1<<20)+5];
	char getchar()
	{
		if(cursor==(1<<20))
		{
			cursor=0;
			fread(buf,1,(1<<20),stdin);
		}
		return buf[cursor++];
	}
	int getnum()
	{
		char ch=0;
		int res=0;
		while(!isdigit(ch)) ch=getchar();
		while(isdigit(ch))
		{
			res=res*10+ch-'0';
			ch=getchar();
		}
		return res;
	}
}
using FastIO::getnum;

int n,rt,src;
vector<int> edges[1000005];
int nxt[1000005];
int par[1000005];

void go(int x,int par)
{
	::par[x]=par;
	for(auto u:edges[x])
	{
		if(u==par) continue;
		go(u,x);
	}
}

int dp[1000005];
void dfs(int x,int cost)
{
	for(auto u:edges[x])
	{
		if(u==par[x]) continue;
		dfs(u,cost+(int)edges[x].size()-1-(nxt[x]!=-1));
	}
	if(nxt[x]!=-1) return;
	vector<int> v;
	v.reserve(edges[x].size());
	for(auto u:edges[x])
	{
		if(u!=par[x]) v.emplace_back(dp[u]);
	}
	sort(all(v));
	reverse(all(v));
	if(!v.size())
	{
		dp[x]=cost;
	}
	else if(v.size()==1)
	{
		dp[x]=cost+1;
	}
	else
	{
		dp[x]=min(v[0],v[1]+1);
	}
}

int check(int k)
{
	int rm=0,used=0;
	for(int x=src;x!=rt;x=par[x])
	{
		rm++;
		int cnt=0;
		for(auto u:edges[x])
		{
			if(u==par[x] || u==nxt[x]) continue;
			if(dp[u]+used>k)
			{
				rm--;
				cnt++;
			}
		}
		if(rm<0) return false;
		used+=cnt;
	}
	return (used<=k);
}

int main()
{
	// freopen("input.txt","r",stdin);
	n=getnum();rt=getnum();src=getnum();
	rt--;src--;
	if(rt==src)
	{
		puts("0");
		return 0;
	}
	for(int i=0;i<n-1;i++)
	{
		int x=getnum(),y=getnum();
		x--;y--;
		edges[x].emplace_back(y);
		edges[y].emplace_back(x);
	}
	go(rt,-1);
	memset(nxt,-1,sizeof(nxt));
	int x=src;
	while(x!=rt)
	{
		nxt[par[x]]=x;
		x=par[x];
	}
	dfs(nxt[rt],0);
	int l=0,r=n,mid,res;
	while(l<=r)
	{
		mid=l+r>>1;
		if(check(mid))
		{
			res=mid;
			r=mid-1;
		}
		else
		{
			l=mid+1;
		}
	}
	cout<<res<<endl;
	return 0;
}