Iam back with yet another ?

How can one find the second best Minimum sPANNing tree (MST)in a graph.. There are standard algo's like Prim and Kruskal to get the MST of a graph.. Does it involve modifications to these?