We study the average behavior of variants of the Union-Find algorithm to maintain partitions of a finite set under the random spanning tree model. By applying the method of moments we can characterize the limiting distribution of the total costs of the algorithms ``Quick Find Weighted'' and ``Quick Find Biased'' extending the analysis of Knuth and Schönhage, Yao, and Chassaing and Marchand.