Kruskal's time complexity is where is the number of edges. Sorting the edges takes . After sorting, you process each edge once. Union-Find operations (find and union) take nearly time with path compression and union by rank.
So the bottleneck is sorting. If edges are already sorted, Kruskal runs in where is the inverse Ackermann function (effectively constant).
Space complexity is for the data structures used.