{

while(parent[x] != x)

{

parent[x] = parent[parent[x]];

x = parent[x];

}

return x;

{

int p = findParent(x);

int q = findParent(y);

parent[p] = parent[q];

{

int x, y;

long long cost, minimumCost = 0;

for(int i = 0;i < edges;++i)

{

x = p[i].second.first; //Selecting edges one by one in increasing order from the beginning

y = p[i].second.second;

cost = p[i].first;

if(findParent(x) != findParent(y)) // check whether selected edge creates a cycle or not

{

minimumCost += cost;

doUnion(x, y);

}

}

return minimumCost;

{

int x, y,nodes, edges;

long long weight, cost, minimumCost;

pair <long long, pair<int, int> > p[MAX];

for(int i = 0;i < MAX;++i)

id[i] = i;

cin >> nodes >> edges;

for(int i = 0;i < edges;++i)

{

cin >> x >> y >> weight;

p[i] = make_pair(weight, make_pair(x, y)); //add the weighted edges to the array containing pair of edges

}

sort(p, p + edges); // Sort the edges in the ascending order

minimumCost = kruskal(p);

cout << minimumCost << endl;

return 0;

}