Kruskal's algorithm

[rosamor]

I've tried to apply Kruskal's algorithm on a graph. I get two results, unsure of which them is the correct one Here is what I have done:

 

[stapel]

I've tried to apply Kruskal's algorithm on a graph. I get two results, unsure of which them is the correct one Here is what I have done:

Shouldn't the correct result be the one with the lower-cost spanning tree? (here)