蒟蒻不知道发生了什么

#include<cmath>
#include<cstdio>
#include<iostream>
#include<algorithm>
const int MAXN = 500000;
const int MAXM = 8000000;
using namespace std;
int fa[MAXN];
struct edge
{
    int f,t,v;
}e[MAXN];
struct edge tmp1,tmp2;
inline bool cmp(edge tmp1,edge tmp2)
{
    return tmp1.v < tmp2.v;
}
int find(int x)
{
    if(fa[x] == x)
        return x;
    return fa[x] = find(fa[x]);
}
bool Union(int x,int y)
{
    x = find(x),y = find(y);
    if(x != y)
    {
        fa[x] = y;
        return 1;
    }
    return 0;
}
int main()
{
    int m,n,ans = 0;
    scanf("%d%d",&n,&m);
    for(int i = 1;i <= m;i ++)
        scanf("%d%d%d",&e[i].f,&e[i].t,&e[i].v);
    sort(e+1,e+1+m,cmp);
    for(int i = 1;i <= m;i ++)
        fa[i] = i;
    int cnt = n;
    for(int i = 1;i <= m && cnt > 1;i ++)
    {
        if(Union(e[i].f,e[i].t))
            ans += e[i].v,cnt --;    
    }
    if(cnt > 1)    printf("orz\n");
    else    printf("%d",ans);
    return 0;
}