#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
using namespace std;
const int N = 100005;
const int M = 1000005;
struct Edge{
int u,v,w;
}edge[M];
struct node{
int x,w;
bool operator < (const node &a) const{
return w > a.w;
}
/*friend bool operator < (const node &a,const node &b){
return a.w > b.w;
}*/
};
int n,m;
priority_queue<node> q;
vector<node> v[N];
int vis[N];
void build(){
memset(vis,0,sizeof(vis));
while(!q.empty())
q.pop();
int a,b,c;
node tmp;
for(int i = 0; i < m; i++){
scanf("%d%d%d",&a,&b,&c);
tmp.x = b;tmp.w = c;
v[a].push_back(tmp);
tmp.x = a;
v[b].push_back(tmp);
}
}
int prime(){
int cost = 0;
node cur;
cur.x = 1;
cur.w = 0;
q.push(cur);
int tt = 0;
while(!q.empty() && tt < n){
cur = q.top();
q.pop();
if(vis[cur.x])
continue;
vis[cur.x] = 1;
cost += cur.w;
tt++;
int l = v[cur.x].size();
for(int i = 0; i < l; i++){
if(!vis[v[cur.x][i].x]){
node tmp;
tmp.x = v[cur.x][i].x;
tmp.w = v[cur.x][i].w;
q.push(tmp);
}
}
}
return cost;
}
int main(){
while(~scanf("%d%d",&n,&m)){
build();
printf("%d\n",prime());
}
return 0;
}