Statement

You are the supervisor of a super-secret government operation, where coordination is key, and everything will go wrong otherwise. You are in charge of N workers, numbered from 1 to N, each of which have the ability to directly communicate with some other workers. These worker relations can be viewed as a tree (connected undirected acyclic graph), where each node represents one of the workers, and each edge represents one of the direct two-sided communication channels between two workers. This relation tree has a special property, namely that, in order to maximize work efficiency, each worker has at most 20 direct communication channels with any other workers. This way, each of the N workers can directly or indirectly communicate with each other, via a series of direct communications. You, as the supervisor, have to handle Q events of the following types: (1) As a result of a mutual agreement, worker A and worker B decide to switch roles in order to prevent burnout...