Chef and Lollipops 2

Now that Chef has a lot of lollipops, some of Chef’s friends are jealous of him. Chef’s friends have trapped him in a tree consisting of $N$ nodes (numbered $1$ through $N$), where node $1$ is the $root$ $node$. On each node there's a friend $i$ who will take $A[i]$ lollipops from chef. But there's a catch. Chef's friends asked him to select any $K$ different nodes and visit them one by one.