it has to be in this Format :

public class Ants {

public static void main(String[] args) {

...

}

...

}

class Edge implements Comparable {

...

}

class DisjointSet {

...

}

Ant Tunneling Filename: ant The evil ants of UCF have taken your teacher hostage in order to force you to help them with a problem. They are trying to interconnect their ant hills, so that there is some way to get from any ant hill to any other ant hill using only tunnels they have dug. They are quite smart ants, so they have already mapped out all the possible tunnels they can dig to connect their ant hills and assigned each a cost. However, before they get to digging, they demand your help to determine which set of tunnels they should choose to dig to minimize the total cost while still connecting all of their ant hills (directly or indirectly). A pair of ant hills is considered connected if there exists a series of tunnels connected end-to-end that form a path between each of the hills. The ants can start digging from any ant hill, but in the end all pairs of hills must have a path of fully dug tunnels connecting them. The Problem: Given the cost of all possible tunnels to connect pairs of ant hills, determine the minimum total cost to dig a tunnel network that connects all ant hills The Input: The first line will contain a positive integer, n, the number of campuses for which the ants want you to solve this problem (UCF has many satellite campuses). Following will be descriptions of n campuses. Each campus description starts with a line containing two integers, h (1 h 100) and t (0 tSh* (h - 1)/ 2), representing the number of ant hills and the number of tunnels the ants can possibly dig, respectively. Each ant hill is assigned a unique number from 1 to h. The following t lines will describe the possible tunnels. Each tunnel is described by three integers, x, y (1