Let's say I have a forest of x trees (a bunch of disconnected trees). How many edges must be added to convert the forest into a single, contiguous tree?
Wouldn't it just be x-1 edges?
The problem also states that the trees have $y_1, y_2, ..., y_x$ vertices, respectively, and I don't understand why this information is relevant.
Am I misinterpreting something?