Chef and Tree

Chef likes trees a lot. Now he thinking about one interesting problem on trees. He finds the following problem interesting, and you? Given a tree T and Q queries to it. Tree T has N nodes numbered from 1 to N. Each node v has a value Av associated with it. Queries can be one of three types. - 1 u v - reverse the values on the path between vertices u and v. - 2 ul ur vl vr - print "Yes" if al