Count Subtrees Max Distance

Given n cities connected as a tree by edges, count how many connected subtrees have each possible diameter value. Return an array where index d counts subtrees with diameter d+1.

Examples
Input: [4,[[1,2],[2,3],[2,4]]]
Output: [3,4,0]
Hints

Count Subtrees Max Distance

Given n cities connected as a tree by edges, count how many connected subtrees have each possible diameter value. Return an array where index d counts subtrees with diameter d+1.