We study the cycle structure of words in several random permutations. We assume that the permutations are independent and that their distribution is conjugation invariant, with a good control on their short cycles. If, after successive cyclic simplifications, the word w still contains at least two different letters, then we get a universal limiting joint law for short cycles for the word in these permutations. These results can be seen as an extension of our previous work [Kammoun and Maïda, 2020] from the product of permutations to any non-trivial word in the permutations and also as an extension of the results of [Nica, 1994] from uniform permutations to general conjugation invariant random permutations. In particular, we get optimal assumptions in the case of the commutator of two such random permutations.