Corollary 24.2

Given A $\subseteq$ MST(G) and a connected component C of the forest G_A(V, A), if (u,v) is a light edge connecting C to some other component in G_A, then (u,v) is safe for A.

Algorithm:
1. Find two unconnected components of G.
2. Connect them using a light edge.