111

#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5+10;
struct edge{
    int u,v;
    ll w;
    bool friend operator<(edge x,edge y){
        return x.w<y.w;
    }
}e[N<<2];
int n,m,f[N],tot = 0;
ll x[N],y[N],u[N],v[N],w[N];
inline int getf(int x){
    if(f[x]==x) return x;
    else return f[x] = getf(f[x]);
}
inline ll kruskal(){
    for(int i = 1;i<=n;i++){
        f[i] = i;
    }
    sort(e+1,e+tot+1);    
    ll res = 0;
    int cnt = 0;
}
int main(){
    return 0;
}

#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5+10;
struct edge{
    int u,v;
    ll w;
    bool friend operator<(edge x,edge y){
        return x.w<y.w;
    }
}e[N<<2];
int n,m,f[N],tot = 0;
ll x[N],y[N],u[N],v[N],w[N];
inline int getf(int x){
    if(f[x]==x) return x;
    else return f[x] = getf(f[x]);
}
inline ll kruskal(){
    for(int i = 1;i<=n;i++){
        f[i] = i;
    }
    sort(e+1,e+tot+1);    
    ll res = 0;
    int cnt = 0;
}
int main(){
    return 0;
}