Weighted Tree Diameter

Given an undirected tree with positive edge weights, print the length of the longest path between any two nodes.

2 <= n <= 10^5 1 <= w <= 10^4