I feel quite anoyed with this problem

how can i count the number of MEX(simple path u to v) = m ( u,v is the same with v,u) on a tree rooted at 1?

and other query is swap the value of node u and node v

Related note: can i have some properties of MEX functions, i have some:

• If the set of numbers want to accquire the MEX = x, it must atleast have x+1 elements without a single element = x

Sorry for bad english

I don't think I need an explanation but... (Use translator if you don't understand) This is very offensive, as it target a specific person without any reason :/. My friend tried to report the blog but it seem like Mike doesn't do anything.

P//S : i will update whether this guy is banned

Link the blog : https://codeforces.me/blog/OcLonVoDucDoan