A graph started as a tree with n nodes (labeled 1..n) and one extra edge was added, creating exactly one cycle. Given `edges` in the order they were added, return the edge that can be removed so the result is a tree. If multiple answers, return the one that appears last in the input.