Anton grow tree garden in case forgot tree connect acyclic undirected graphThere n vertex tree paint black white Anton do not like multicolore tree want change tree vertex color black whiteTo change color Anton use operation type we denote paintv v vertex tree this operation change color vertex u vertice short path v u color include v u for example consider tree apply operation paint3 follow Anton interested minimum number operation need perform order color vertex equal