NEED IN JAVASCRIPT

In this problem we consider an undirected tree with N nodes, numbered from 1 to N. Additionally, each node also has a label attached to it and the label is an integer value. Note that different nodes can have identical labels. Write a function: Eunction solution(A, E) that, given a zero-indexed array A of length N, where A[J is the label value of the (J+1) th node in the tree, and a zero-indexed array E of length K (N-1) * 2 in which the edges of the tree are described (for every 0 sJ<>