D - Is There A Second Way Left? （次小生成树）

D - Is There A Second Way Left?
Sample Input
4
5 4
1 2 5
3 2 5
4 2 5
5 4 5
5 3
1 2 5
3 2 5
5 4 5
5 5
1 2 5
3 2 5
4 2 5
5 4 5
4 5 6
1 0
Sample Output
Case #1 : No second way
Case #2 : No way
Case #3 : 21
Case #4 : No second way
次小生成树，用最小生成树的克鲁斯卡尔算法，然后删边，看是否可以构成一个生成树。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#define INF 0x3f3f3f3f
using namespace std;
int n, m;
struct node
{
   int u, v, cost;
}e[121211];
int pre[121211];
int edge[112211];
bool cmp(struct node a, struct node b)
{
  return a.cost<b.cost;
}
int Find(int a)
{
  while(a!=pre[a])
  a = pre[a];
  return a;
}
int top;
int Kru()
{
    int num = 0;
    for(int i=0;i<=n;i++)
    pre[i] = i;
    for(int i=0;i<m;i++)
    {
      int x = Find(pre[e[i].u]);
      int y = Find(pre[e[i].v]);
      if(x!=y)
      {
         num += e[i].cost;
         edge[++top] = i;
         pre[y] = x;
      }
    }
    int k = 0;
    for(int i = 1;i<=n;i++)
    {
       if(pre[i]==i)
       k++;
    }
    if(k==1)
    return num;
    else
    return INF;
}
//int top;
int Kru2(int xx)
{
    int num = 0;
    for(int i=0;i<=n;i++)
       pre[i] = i;
    for(int i=0;i<m;i++)
    {
      if(i==xx)
      continue;
      int x = Find(pre[e[i].u]);
      int y = Find(pre[e[i].v]);
      if(x!=y)
      {
         num += e[i].cost;
//         edge[++top] = i;
         pre[y] = x;
      }
    }
    int k = 0;
    for(int i = 1;i<=n;i++)
    {
       if(pre[i]==i)
       k++;
    }
    if(k==1)
    return num;
    else
    return INF;
}
int main()
{
   int T;
   scanf("%d", &T);
   for(int t = 1; t <= T; t++)
   {
     scanf("%d %d", &n, &m);
     for(int i=0;i<m;i++)
     {
       scanf("%d %d %d", &e[i].u, &e[i].v, &e[i].cost);
     }
     sort(e, e+m, cmp);
     top = -1;
     int ans1 = Kru(), ans2 = INF;
     for(int i=0;i<=top;i++)
     {
        int x = edge[i];
       ans2 = min(ans2, Kru2(x));
     }
     if(ans1==INF)
     printf("Case #%d : No way\n", t);
     else if(ans2==INF)
     printf("Case #%d : No second way\n", t);
     else
    printf("Case #%d : %d\n", t, ans2);
   }
  return 0;
}