Undirected weighted tree is given. Find the length of the longest path. Find two vertices the distance between which is maximum. \InputFile The first line contains the number of vertices in the tree $n\:(2 \le n \le 10^5)$. The next $n - 1$ lines describe the edges. Each line contains three integers: numbers of vertices connected with an edge (vertices are numbered from $1$ to $n$) and the weight $w\:(1 \le w \le 10^5)$ of an edge. \OutputFile Print the length of the longest path. \includegraphics{https://static.e-olymp.com/content/17/17384ca58bc01aa7abc206fc159e9b77f7435c71.gif}