Sum of Distances in a Tree

Statement

Given a connected, undirected tree with n nodes, labeled from $0$ to $n - 1$, and $n - 1$ edges. The edges are provided in an array, where each element edges[i] $= [a_i, b_i]$ ...