Freaks City

This problem involves a tree with \(n\) nodes and \(n-1\) weighted edges. One edge can have its weight set to zero. Given \(T\) pairs of nodes \((u, v)\), the goal is to choose an edge to delete (set weight to zero) such that the maximum distance between any pair \((u, v)\) is minimized. Output this minimum possible maximum distance. Core Appro ...