Eating Chocolates

There is an undirected tree with $N$ nodes numbered $1$ to $N$ rooted at $1$. Each node is having exactly one chocolate initially. There is a magician performing a spell at a certain node $p$ given by query $[1$ $p$ $k]$. After performing the spell, the number of chocolates is multiplied by $k$ for each node in the subtree rooted at $p$. All the chocolates present at a node will be distinct at all