Profitable Paths 2

You are given a tree with $N$ vertices (numbered $1$ through $N$) and a sequence of integers $A_1, A_2, \ldots, A_N$. You may choose an arbitrary permutation $p_1, p_2, \ldots, p_N$ of the integers $1$ through $N$. For each valid $i$, you should assign the value $A_{p_i}$ to vertex $i$. Then, you should choose a vertex of the tree and $K-1$ times, perform one of the following operations: - Mov