#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;

int n,m;

int p[100001];
int root(int x) {
	if (p[x]==x) return x;
	return p[x]=root(p[x]);
}

int main() {
	//freopen("test.in","r",stdin);
	//scanf("%d %d",&n,&m);
	n=100000; m=1000000;
	vector<pair<int, pair<int,int> > > edges;
	for (int i=0;i<m;i++) {
		int a,b,c;
		//scanf("%d %d %d",&a,&b,&c);
		a=1+rand()%n; b=1+rand()%n; c=rand()%10000;
		edges.push_back({c,{a,b}});
	}
	sort(edges.begin(),edges.end());
	for (int i=1;i<=n;i++) p[i]=i;
	int mst=0;
	for (int i=0;i<m;i++) {
		int c=edges[i].first;
		int a=edges[i].second.first, b=edges[i].second.second;
		int ra=root(a), rb=root(b);
		if (ra!=rb) {
			mst+=c;
			p[rb]=ra;
		}
	}
	printf("%d\n",mst);
	return 0;
}