For this assignment, you are implementing disjoint sets with the forest approach and using them to implement Kruskal's algorithm. Both of these are covered in CLRS and have short pseudocode.
Your test code needs to include tests of all the methods you have to implement. For both the disjoint sets and the minimum spanning tree you should have a test with at least 1000 sets/vertices.