#include <cassert>// c
#include <iostream>// io
#include <iomanip>
#include <fstream>
#include <sstream>
#include <vector>// container
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <algorithm>// other
#include <complex>
#include <numeric>
#include <functional>
using namespace std;

typedef int32_t i32;typedef int64_t i64;typedef i64 ll;typedef uint32_t uint;typedef uint64_t ull;

#define ALL(c) (begin(c)),(end(c))
#define REP(i,n) FOR(i,0,n)
#define REPr(i,n) FORr(i,0,n)
#define FOR(i,l,r) for(int i=(int)(l);i<(int)(r);++i)
#define FORr(i,l,r) for(int i=(int)(r)-1;i>=(int)(l);--i)
#define EACH(it,o) for(__typeof((o).begin()) it = (o).begin(); it != (o).end(); ++it)
#define IN(l,v,r) ((l)<=(v) && (v)<(r))

//debug
#define DUMP(x)  cerr << #x << " = " << (x)
#define DUMPLN(x)  DUMP(x) <<endl
#define DEBUG(x) DUMP(x) << LINE() << " " << __FILE__
#define DEBUGLN(x) DEBUG(x)<<endl
#define LINE()    cerr<< " (L" << __LINE__ << ")"
#define LINELN()    LINE()<<endl
#define CHECK(exp,act)  if(exp!=act){DUMPLN(exp);DEBUGLN(act);}
#define STOP(e)  CHECK(e,true);if(!(e)) exit(1);

class range {
private:
    struct Iter{
        int v;
        int operator*(){return v;}
        bool operator!=(Iter& itr) {return v < itr.v;}
        void operator++() {++v;}
    };
    Iter i, n;
public:
    range(int n) : i({0}), n({n}) {}
    range(int i, int n) : i({i}), n({n}) {}
    Iter& begin() {return i;}
    Iter& end() {return n;}
};

//output
template<typename T> ostream& operator << (ostream& os, const vector<T>& as){REP(i,as.size()){if(i!=0)os<<" "; os<<as[i];}return os;}
template<typename T> ostream& operator << (ostream& os, const vector<vector<T> >& as){REP(i,as.size()){if(i!=0)os<<endl; os<<as[i];}return os;}
template<typename T> ostream& operator << (ostream& os, const set<T>& ss){EACH(a,ss){if(a!=ss.begin())os<<" "; os<<a;}return os;}
template<typename T1,typename T2> ostream& operator << (ostream& os, const pair<T1,T2>& p){os<<p.first<<" "<<p.second;return os;}
template<typename K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;EACH(p,m){if(!isF)os<<endl;os<<p;isF=false;}return os;}

//input
char tmp[1000];
#define nextInt(n) scanf("%d",&n)
#define nextLong(n) scanf("%lld",&n) //I64d
#define nextDouble(n) scanf("%lf",&n) 
#define nextChar(n) scanf("%c",&n)
#define nextString(n) scanf("%s",tmp);n=tmp

// values
template<typename T> T INF(){assert(false);};
template<> int INF<int>(){return 1<<28;};
template<> ll INF<ll>(){return 1LL<<58;};
template<> double INF<double>(){return 1e16;};


struct UnionFind{
    vector<int> par,rank,ss;
    int size;
    UnionFind(int n){
        REP(i,n) par.push_back(i);
        rank = vector<int>(n);ss=vector<int>(n,1);size=n;
    }
    int root(int x){
        if(par[x] == x)return x;
        return par[x] = root(par[x]);
    }
    bool same(int x,int y){
        return root(x) == root(y);
    }
    void unite(int x,int y){
        x = root(x);y = root(y);
        if(x==y)return;
        if(rank[x] < rank[y]){
            par[x] = y;ss[y]+=ss[x];
        }else{
            par[y] = x;ss[x]+=ss[y];
        }
        if(rank[x] == rank[y]) rank[x]++;
        size--;
    }
    int getS(int x){
        return ss[root(x)];
    }
};

namespace EGraph{
    typedef int Cost;Cost CINF=INF<Cost>();
    struct Edge{
        int from,to;Cost cost;
        Edge(int from,int to,Cost cost)
        : from(from),to(to),cost(cost) {};
        bool operator<(Edge r) const{ return cost<r.cost;}
        bool operator>(Edge r) const{ return cost>r.cost;}
    };
    typedef vector<vector<Edge> >  Graph;
}

namespace SpanningTree{
    using namespace EGraph;

    //条件: 連結区間内
    //O(E*log(V))
    // verified by ACAC002 B
    // http://judge.u-aizu.ac.jp/onlinejudge/creview.jsp?rid=899143&cid=ACAC002
    Cost prim(Graph g,int s){
        const int V=g.size();
        vector<bool> visited(V);
        priority_queue<Edge,vector<Edge>,greater<Edge>> que;que.push(Edge(-1,s,0));
        Cost res=0;
        while(!que.empty()){
            Edge task=que.top();que.pop();
            int pos=task.to;
            if(visited[pos])continue;
            visited[pos]=true;
            res+=task.cost;
            for(Edge e:g[pos])if(!visited[e.to])que.push(e);
        }
        return res;
    }

    //O(E*log(V))
    // verified by ACAC002 B
    // http://judge.u-aizu.ac.jp/onlinejudge/creview.jsp?rid=899132&cid=ACAC002
    Cost kruskal(const Graph& g){
        const int V=g.size();
        UnionFind uf=UnionFind(V);
        priority_queue<Edge,vector<Edge>,greater<Edge>> que;
        REP(u,V)for(Edge e:g[u])que.push(e);
        Cost res=0;
        while(!que.empty()){
            Edge e=que.top();que.pop();
            if(!uf.same(e.from,e.to)){
                uf.unite(e.from,e.to);
                res+=e.cost;
            }
        }
        return res;
    }
}

using namespace SpanningTree;
stringstream ss;
class Main{
    public:
    void run(){
        int n,m;cin >> n >> m;
        Graph g(n);
        REP(i,m){
            int s,t,d;cin >> s >> t >> d;
            g[s].push_back(Edge(s,t,d));g[t].push_back(Edge(t,s,d));
        }
        cout << prim(g,0) <<endl;
    }
};

int main(){
 cout <<fixed<<setprecision(20);
 cin.tie(0);
 ios::sync_with_stdio(false);
 Main().run();
 return 0;
}

Measured memory_bytes: 9256