CF - Wizard's Tour

Official Editorial (brief)

In other words, we want to pair up as many edges as possible such that the edges in each pair share a vertex.

Obviously the task can be solved independently for each component.

The answer is always $\left\lfloor \frac{m}{2}\right\rfloor$ for a single connected component.

Tree Case

General Case