#include<iostream>

#include<cstdio>

#include<algorithm>

using namespace std;

struct s{

    int h;

    int t;

    int w;

};

int fa[];

bool cmp(s a,s b)

{

    return a.w < b.w;

}

int find(int a)

{

    if(fa[a] != a)  //不是while

    fa[a] = find(fa[a]);

    return fa[a];

}

void un(int a,int b)

{

    a = find(a);

    b = find(b);

    if(a != b)

    fa[b] = a;

}

bool judge(int a,int b)

{

    a = find(a);

    b = find(b);

    if(a != b)

    return false;

    else return true;

}

s side[];

int m,n,k,tot = ,num = ;

int main()

{

    cin>>n>>k;

    for(int i = ;i <= n;i++)

    {

        fa[i] = i;

    }

    for(int i = ;i <= k;i++)

    {

        cin>>side[i].h>>side[i].t>>side[i].w;

        //tot += side[i].w;

    }

    sort(side + ,side + k + ,cmp);

    tot = ;

    for(int i = ;i <= k;i++)

    {

        if(judge(side[i].h,side[i].t) == false)

        {

            un(side[i].h,side[i].t);

            tot += side[i].w;

            num++;

        }

        if(num == n)

        break;

    }

    cout<<tot<<endl;

    return ;

}

/*

5 5

1 2 8

1 3 1

1 5 3

2 4 5

3 4 2

*/

#include<iostream>

using namespace std;

int fa[],m,n,x,y,z;

int find(int a)

{

    if(fa[a] != a)

    fa[a] = find(fa[a]);

    return fa[a];

}

bool judge(int a,int b)

{

    a = find(a);

    b = find(b);

    if(a != b)

    return false;

    else

    return true;

}

void un(int a,int b)

{

    a = find(a);

    b = find(b);

    if(a != b)

    fa[b] = a;

}

int main()

{

    cin>>m>>n;

    for(int i = ;i < m;i++)

    fa[i] = i;

    for(int i = ;i <n;i++)

    {

        cin>>x>>y>>z;

        if(x == )

        {

            if(judge(y,z) == false)

            un(y,z);

        }

        else

        {

            if(judge(y,z) == true)

            cout<<"Yeah"<<endl;

            else

            cout<<"No,opps"<<endl;

        }

    }

    return ;

}