int findx(int x)
{
return p[x] == x ? x : p[x] = findx(p[x]);
}
long long Kruskal()
{
long long ans = 0;
for(int i = 0; i < n; i ++)
p[i] = i;
sort(a,a + m);
for(int i = 0; i < m; i ++)
{
int x = findx(a[i].u);
int y = findx(a[i].v);
if(x != y)
{
ans += a[i].w;
p[x] = y;
}
}
return ans;
}