Please use python to solve it

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: sk 2 int solution(vectorcint> &A, vectorkint>&E); that, given a zero-indexed array A of length N, where AlJ] is the label i 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 &A, vectorkint>&E); that, given a zero-indexed array A of length N, where AlJ] is the label i 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