Constructs a Minimum Spanning Tree greedily by sorting edges by weight and using a Disjoint Set structure to safely combine components.