fn dfs(pos: usize, pre: Option<usize>, edges: &[Vec<usize>], d: usize, costs: &mut [usize]) {
    costs[pos] = d;
    for &nxt in edges[pos].iter() {
        if let Some(p) = pre {
            if p == nxt {
                continue;
            }
        }
        dfs(nxt, Some(pos), edges, d + 1, costs);
    }
}


fn solve() {
    let stdin = std::io::stdin();
    let mut scn = Scanner {
        stdin: stdin.lock(),
    };
    let n: usize = scn.read::<usize>();

    let u: usize = scn.read::<usize>() - 1;
    let v: usize = scn.read::<usize>() - 1;
    let mut edges = vec![vec![]; n];
    let ab: Vec<_> = (0..n - 1)
        .map(|_| {
            let x: usize = scn.read::<usize>() - 1;
            let y: usize = scn.read::<usize>() - 1;
            edges[x].push(y);
            edges[y].push(x);
            (x, y)
        })
        .collect();
        let mut costs1 = vec![0; n];
        let mut costs2 = vec![0; n];
        dfs(u, None, &edges, 0, &mut costs1);
        dfs(v, None, &edges, 0, &mut costs2);
        
        let mut result = 0;
        for (c1, c2) in costs1.iter().zip(costs2.iter()) {            
            if c1 < c2 {
                result = std::cmp::max(result, *c2);
            }
        }
        println!("{}", result - 1);
}
fn main() {
    std::thread::Builder::new()
        .stack_size(64 * 1024 * 1024) // 64MB
        .spawn(|| solve())
        .unwrap()
        .join()
        .unwrap();
}
pub mod utils {
    const DYX: [(isize, isize); 8] = [
        (0, 1),   //right
        (1, 0),   //down
        (0, -1),  //left
        (-1, 0),  //top
        (1, 1),   //down right
        (-1, 1),  //top right
        (1, -1),  //down left
        (-1, -1), //top left
    ];

    pub fn try_adj(y: usize, x: usize, dir: usize, h: usize, w: usize) -> Option<(usize, usize)> {
        let ny = y as isize + DYX[dir].0;
        let nx = x as isize + DYX[dir].1;
        if ny >= 0 && nx >= 0 {
            let ny = ny as usize;
            let nx = nx as usize;
            if ny < h && nx < w {
                Some((ny, nx))
            } else {
                None
            }
        } else {
            None
        }
    }
}

//snippet from kenkoooo
pub struct Scanner<R> {
    stdin: R,
}

impl<R: std::io::Read> Scanner<R> {
    pub fn read<T: std::str::FromStr>(&mut self) -> T {
        use std::io::Read;
        let buf = self
            .stdin
            .by_ref()
            .bytes()
            .map(|b| b.unwrap())
            .skip_while(|&b| b == b' ' || b == b'\n' || b == b'\r')
            .take_while(|&b| b != b' ' && b != b'\n' && b != b'\r')
            .collect::<Vec<_>>();
        unsafe { std::str::from_utf8_unchecked(&buf) }
            .parse()
            .ok()
            .expect("Parse error.")
    }
    pub fn read_line(&mut self) -> String {
        use std::io::Read;
        let buf = self
            .stdin
            .by_ref()
            .bytes()
            .map(|b| b.unwrap())
            .skip_while(|&b| b == b'\n' || b == b'\r')
            .take_while(|&b| b != b'\n' && b != b'\r')
            .collect::<Vec<_>>();
        unsafe { std::str::from_utf8_unchecked(&buf) }
            .parse()
            .ok()
            .expect("Parse error.")
    }
    pub fn vec<T: std::str::FromStr>(&mut self, n: usize) -> Vec<T> {
        (0..n).map(|_| self.read()).collect()
    }

    pub fn chars(&mut self) -> Vec<char> {
        self.read::<String>().chars().collect()
    }
}


Measured memory_bytes: 27004