Given a scalar graph of n vertices and n-1 edges. Any two vertices can reach each other through the edges. For each vertex i, find the shortest length from vertex 1 to all vertices divided by vertex i and then return to vertex 1 (with 1 <= i <= n) . (n<=100000)