Rainbow powers of a Hamilton cycle in G(n,p)

We show that the threshold for having a rainbow copy of a power of a Hamilton cycle in a randomly edge colored copy of $G_{n,p}$ is within a constant factor of the uncolored threshold. Our proof requires $(1+\epsilon )$ times the minimum number of colors.