Problem:
Score : 600 points

Problem Statement

We have a tree with N vertices. The i-th edge connects Vertex A_i and B_i bidirectionally.

Takahashi is standing at Vertex u, and Aoki is standing at Vertex v.

Now, they will play a game of tag as follows:

1. If Takahashi and Aoki are standing at the same vertex, the game ends. Otherwise, Takahashi moves to a vertex of his choice that is adjacent to his current vertex.

2. If Takahashi and Aoki are standing at the same vertex, the game ends. Otherwise, Aoki moves to a vertex of his choice that is adjacent to his current vertex.

3. Go back to step 1.

Takahashi performs his moves so that the game ends as late as possible, while Aoki performs his moves so that the game ends as early as possible.

Find the number of moves Aoki will perform before the end of the game if both Takahashi and Aoki know each other's position and strategy.

It can be proved that the game is bound to end.

Constraints

2 \leq N \leq 10^5

1 \leq u,v \leq N

u \neq v

1 \leq A_i,B_i \leq N

The given graph is a tree.

Input

Input is given from Standard Input in the following format:

N u v
A_1 B_1
:
A_{N-1} B_{N-1}

Output

Print the number of moves Aoki will perform before the end of the game.

Sample Input 1

5 4 1
1 2
2 3
3 4
3 5

Sample Output 1

2

If both players play optimally, the game will progress as follows:

Takahashi moves to Vertex 3.

Aoki moves to Vertex 2.

Takahashi moves to Vertex 5.

Aoki moves to Vertex 3.

Takahashi moves to Vertex 3.

Here, Aoki performs two moves.

Note that, in each move, it is prohibited to stay at the current vertex.

Sample Input 2

5 4 5
1 2
1 3
1 4
1 5

Sample Output 2

1

Sample Input 3

2 1 2
1 2

Sample Output 3

0

Sample Input 4

9 6 1
1 2
2 3
3 4
4 5
5 6
4 7
7 8
8 9

Sample Output 4

5

Solution in Haskell (GHC 7.10.3) (judge verdict: Time Limit Exceeded)

module Main
  ( main
  )
where

import           Control.Applicative
import           Control.Monad
import           Data.List
import           Data.Array
import           Data.Char
import           Data.Bits
import qualified Data.ByteString.Char8 as BS
import Data.Maybe

parse = fst . fromJust
parseInt = parse . BS.readInt
parseInteger = parse . BS.readInteger
readInt = parseInt <$> BS.getLine
readInteger = parseInteger <$> BS.getLine
readIntList = map parseInt . BS.words <$> BS.getLine

main = do
  [n, u, v] <- readIntList
  arr <- concat <$> replicateM (n - 1) ((\[a, b] -> [(a, b), (b, a)]) <$> readIntList)
  let graph = createUnweightedGraphFromList n arr
      dist1 = depthFirstSearchTree u graph
      dist2 = depthFirstSearchTree v graph
      farthest = maximum . map snd . filter (\(a, b) -> a < b) $ zip dist1 dist2
  print $ farthest - 1

type Vertex = Int
type Cost = Int
type Capacity = Int

data Edge = Edge { from :: Vertex, to :: Vertex, cost :: Cost, cap :: Capacity } deriving (Eq, Ord, Show)
createUnweightedEdge (from, to) = Edge { from=from, to=to, cost=1, cap=0 }
createUnweightedEdgeArrayFromList arr = listArray (1, length arr) . map createUnweightedEdge $ arr

type Graph = Array Vertex (Array Int Edge)
createUnweightedGraphFromList::Int -> [(Vertex, Vertex)] -> Graph
createUnweightedGraphFromList n = listArray (1, n) . map createUnweightedEdgeArrayFromList . groupBy (\a b -> fst a == fst b) . sort

depthFirstSearchTree::Vertex -> Graph -> [Cost]
depthFirstSearchTree src = map snd . sort . depthFirstSearchTreeUpdate [(src, src, 0)]

depthFirstSearchTreeUpdate::[(Vertex, Vertex, Cost)] -> Graph -> [(Vertex, Cost)]
depthFirstSearchTreeUpdate ((v, p, c):xs) graph = let newVisited = map (\e -> (to e, from e, c + cost e)) . filter (\e -> to e /= p) . elems $ graph ! v
                                                in depthFirstSearchTreeUpdate (newVisited ++ xs) graph ++ [(v, c)]
depthFirstSearchTreeUpdate [] graph = []