void Kruskal() {
	for(int i = 1; i <= n; i ++)
		fa[i] = i;
	vector<int> vec(m);
	iota(vec.begin(), vec.end(), 1);
	sort(vec.begin(), vec.end(), [](int x, int y) {
		return w[x] > w[y];
	});
	for(int i : vec) {
		if(find(u[i]) == find(v[i])) continue;
		val[++n] = w[i]; fa[n] = n;
		G[n].push_back(find(u[i])), G[n].push_back(find(v[i]));
		fa[find(u[i])] = fa[find(v[i])] = n;
	}
}

void kru() {
    for(int i = 1;i <= n;i++)
        fa[i] = i;
    sort(ro + 1 , ro + m + 1 , cmp);
    
    for(int i = 1;i <= m;i++) {
        int fu = find(ro[i].u), fv = find(ro[i].v);
        if(fu == fv) continue;
        
        fa[++n] = n;
        val[n] = ro[i].w;
        G[n].push_back(fu);
        G[n].push_back(fv);
        fa[fu] = n;
        fa[fv] = n;
    }
}

 fa[++n] = n;
 val[n] = ro[i].w;