B"You are given a tree, consisting of n vertices, numbered from 1 to n . Every vertex is colored in some color, denoted by an integer from 1 to n . A simple path of the tree is called beautiful if: Count the number of the beautiful simple paths of the tree. Note that paths are considered undirected (i. e. the path from x to y is the same as the path from y to x ). The first line contains a single integer t ( 1 <= t <= 10^4 ) -- the number of testcases. The first line of each testcase contains a single integer n ( 2 <= n <= 2 cdot 10^5 ) -- the number of vertices in the tree. The second line contains n integers c_1, c_2, ... , c_n ( 1 <= c_i <= n ) -- the color of each vertex. The i -th of the next n - 1 lines contains two integers v_i and u_i ( 1 <= v_i, u_i <= n ; v_i neq u_i ) -- the i -th edge of the tree. The given edges form a valid tree. The sum of n over all testcases doesn't exceed 2 cdot 10^5 . For each testcase, print a single integer -- the number of the beautiful simple paths of the tree. "...