you give tree ie connect undirected graph cycle consist n node number 0 n 1 exactly n 1 edge the root tree node 0 node tree label lowercase character give string label ie the node number label labelsithe edge array give form edgesi ai bi mean edge node ai bi treeReturn array size n ansi number nod subtree ith node label node iA subtree tree t tree consist node T descendant node Example 1input n 7 edge 010214152326 label abaedcdOutput 2111111explanation Node 0 label subtree node 2 label answer 2 Notice node subtreeNode 1 label b the subtree node 1 contain node 14 5 node 4 5 different label node 1 answer 1 node itselfexample 2input n 4 edge 011203 label bbbbOutput 4211explanation the subtree node 2 contain node 2 answer 1the subtree node 3 contain node 3 answer 1the subtree node 1 contain node 1 2 label b answer 2the subtree node 0 contain node 0 1 2 3 label b answer 4example 3input n 5 edge 01021304 label aababOutput 32111 Constraints1 n 105edgeslength n 1edgesilength 20 ai bi nai bilabelslength nlabel consist lowercase english letter