B'The Oak has n nesting places, numbered with integers from 1 to n . Nesting place i is home to b_i bees and w_i wasps. Some nesting places are connected by branches. We call two nesting places adjacent if there exists a branch between them. A simple path from nesting place x to y is given by a sequence s_0, ldots, s_p of distinct nesting places, where p is a non-negative integer, s_0 = x , s_p = y , and s_{i-1} and s_{i} are adjacent for each i = 1, ldots, p . The branches of The Oak are set up in such a way that for any two pairs of nesting places x and y , there exists a unique simple path from x to y . Because of this, biologists and computer scientists agree that The Oak is in fact, a tree. A village is a nonempty set V of nesting places such that for any two x and y in V , there exists a simple path from x to y whose intermediate nesting places all lie in V . A set of villages cal P is called a partition if each of the n nesting places is contained in exactly one of the villages in cal P . In other words, no two villages in cal P share any common nesting place, and altogether, they contain all n nesting places. The Oak holds its annual Miss Punyverse beauty pageant. The two contestants this year are Ugly Wasp and Pretty Bee. The winner of the beauty pageant is determined by voting, which we will now explain. Suppose mathcal{P} is a partition of the nesting places into m villages V_1, ldots, V_m . There is a local election in each village. Each of the insects in this village vote for their favorite contestant. If there are strictly more votes for Ugly Wasp than Pretty Bee, then Ugly Wasp is said to win in that village. Otherwise, Pretty Bee wins. Whoever wins in the most number of villages wins. As it always goes with these pageants, bees always vote for '...