Why Kruskal Algorithm has to iterate all edges?

Question

So here is the pseudocode of Kruskal from Wiki

algorithm Kruskal(G) is
F:= ∅
for each v ∈ G.V do
    MAKE-SET(v)
for each (u, v) in G.E ordered by weight(u, v