An edge-colored graph G is called rainbow if every edge of G receives a different color. Given any host graph G, the anti-Ramsey number of t edge-disjoint rainbow spanning trees in G, denoted by r(G, t), is defined as the maximum number of colors in an edge-coloring of G containing no t edge-disjoint rainbow spanning trees.