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

// varibable settings
#define int long long
const int INF=1e18;
const int MOD=1e9+7;

// define basic macro {{{
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define _rrep(i,n) rrepi(i,0,n)
#define rrepi(i,a,b) for(int i=(int)((b)-1);i>=(int)(a);--i)
#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep,)(__VA_ARGS__)
#define each(i,a) for (auto&& i : a)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define mt(a, b, c) make_tuple(a, b, c)
#define ceil(a,b) ((a)+(b)-1)/(b)
#define is_in(x, a, b) ((a)<=(x) && (x)<(b))
#define uni(x) sort(all(x));x.erase(unique(all(x)),x.end())
#define ub upper_bound
#define lb lower_bound
#define posl(A, x) (lower_bound(all(A), x)-A.begin())
#define posu(A, x) (upper_bound(all(A),x)-A.begin())
template<class T> inline void chmax(T &a, const T &b) { if((a) < (b)) (a) = (b); }
template<class T> inline void chmin(T &a, const T &b) { if((a) > (b)) (a) = (b); }

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int,int> pii;
typedef tuple<int,int,int> iii;

template<typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
struct Fast { Fast(){ std::cin.tie(0); ios::sync_with_stdio(false); } } fast;

#if defined(PCM) || defined(LOCAL)
  #include "lib/dump.hpp"
#else
  #define dump(...) 42
  #define dump_1d(...) 42
  #define dump_2d(...) 42
#endif
//}}}


using COST = int;
using POS = int;
using EDGE = pair<POS, COST>;
struct GRAPH{
  map<POS, vector<EDGE>> all_edges;
  vector<POS> all_nodes;

  void add_edge(POS from, POS to, COST cost){
    all_edges[from].emplace_back(mp(to, cost));
  }

  auto operator[](POS pos){
    return all_edges[pos];
  }
};
auto& operator<<(auto& stream, GRAPH G){
  stream << G.all_edges;
  return stream;
}

map<POS, COST> dijkstra(GRAPH& G, POS start){
  map<POS, COST> d;  // 最短距離
  each(node, G.all_nodes) {d[node] = INF;}

  PQ<pair<COST, POS>> q;
  q.push(mp(0LL, start));
  while (!q.empty()){
    auto cp = q.top(); q.pop();
    auto cost = cp.first;
    auto pos = cp.second;

    if (cost < d[pos]) {
      d[pos] = cost;
      for (const auto &el:G[pos]){
        auto ncost = cost + el.second;
        auto npos = el.first;
        if (ncost < d[npos]) q.push(mp(ncost, npos));
      }
    }
  }
  return d;
}


signed main() {
  int n,u,v;cin>>n>>u>>v;
  u--;v--;
  GRAPH G;
  rep(i, n) G.all_nodes.pb(i);  // add node
  rep(i, n-1){
    int a,b;cin>>a>>b;
    a--;b--;
    G.add_edge(a, b, 1);
    G.add_edge(b, a, 1);
  }

  // calc min distance by G
  POS start=v;
  auto d = dijkstra(G, start);
  dump(d);

  // search eda
  vi eda(n);
  {
    vi used(n);
    stack<int> st;
    st.push(v);
    while(!st.empty()){
      auto t = st.top();st.pop();
      used[t] = 1;
      int cnt = 0;
      each(el, G.all_edges[t]){
        int nt = el.first; 
        if (used[nt]==0){
          st.push(nt);
          cnt++;
        }
      }
      if (cnt==0) eda[t] = 1;
    }
    dump(eda);
  }


  // last step
  int ans = 0;

  {
    vi reach(n);
    stack<pair<int, int>> st;
    st.push(mp(u, 0));
    while(!st.empty()){
      auto tmp = st.top();st.pop();
      int t = tmp.first;
      int cost = tmp.second;
      reach[t] = 1;

      dump(t, cost, d[t]);
      if (!eda[t]) chmax(ans, d[t]);
      each(el, G.all_edges[t]){
        int nt = el.first; 
        int ncost = cost+1;
        if (reach[nt]==0 && ncost < d[nt]){
          st.push(mp(nt, ncost));
        }
        if (reach[nt]==0 && ncost==d[nt]){
          chmax(ans, d[nt]);
        }
      }
    }
    dump(reach);
  }
  cout << ans << endl;

  return 0;
}


Measured memory_bytes: 22772