def main():
    N, u, v = (int(i) for i in input().split())
    G = [[] for _ in range(N)]
    for i in range(N-1):
        a, b = (int(i) for i in input().split())
        G[a-1].append(b-1)
        G[b-1].append(a-1)

    d_from_u = [(1 << 63)-1 for i in range(N)]
    d_from_v = [(1 << 63)-1 for i in range(N)]

    def dfs(v, d):
        seen = [False] * N
        todo = []
        seen[v] = True
        d[v] = 0
        todo.append(v)
        while todo:
            u = todo[-1]

            for next_v in G[u]:
                if seen[next_v]:
                    continue
                seen[next_v] = True
                d[next_v] = d[u] + 1
                todo.append(next_v)
                break
            else:
                todo.pop()

    u, v = u-1, v-1
    dfs(u, d_from_u)
    dfs(v, d_from_v)
    ans = 0
    for du, dv in zip(d_from_u, d_from_v):
        if du < dv and ans < dv - 1:
            ans = dv - 1
    print(ans)


if __name__ == '__main__':
    main()
