ATWNT(Upper Bound) Time Complexity

In the editorial for each query they are doing division for each child. Is there a bound on the number of different factors of children that can come to the root.
I saw someone saying it as root(n) .is there a proof .
Even the editorial does not have anything like that.