Codeforces problem Div 1 B

problem link-
can anyone help me to understand the question. what is the definition of Multihedgehog
i m not able to understand this statement written in the question -" For all k≥2, k-multihedgehog is (k−1)-multihedgehog in which the following changes has been made for each vertex v with degree 1: let u be its only neighbor; remove vertex v, create a new hedgehog with center at vertex w and connect vertices u and w with an edge. New hedgehogs can differ from each other and the initial gift."