var
a,b,v,p:array[1..100] of longint;
n,m,i,ans,tot,x,y:longint;
procedure sort(l,r:longint);
var
i,j,x,y:longint;
begin
i:=l;j:=r;x:=v[(l+r) div 2];
repeat
while v[i]<x do inc(i);
while x<v[j] do dec(j);
if not(i>j) then begin
y:=v[i];v[i]:=v[j];v[j]:=y;
y:=a[i];a[i]:=a[j];a[j]:=y;
y:=b[i];b[i]:=b[j];b[j]:=y;
inc(i);j:=j-1;
end;
until i>j;
if l<j then sort(l,j);
if i<r then sort(i,r);
end;
function doit(x:longint):longint;
begin
if p[x]=x then begin
doit:=x;
ans:=x;
end
else begin
doit:=doit(p[x]);
p[x]:=ans; //重要!!!!!!!!!!并查集一大特色
end;
end;
begin
readln(n,m);
for i:=1 to m do readln(a[i],b[i],v[i]);
sort(1,m);
for i:=1 to n do p[i]:=i;
for i:=1 to m do begin
x:=doit(a[i]);y:=doit(b[i]);
if x<>y then begin
p[x]:=y;
tot:=tot+v[i];
end;
end;
writeln(tot);
readln;
end.