#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=2010,M=10010;
int p[N],n,m;
int find(int x){
if(p[x]!=x)p[x]=find(p[x]);
return p[x];
}
struct node{
int a,b,dist;
bool operator<(const node&a)const{
return dist<a.dist;
}
}edges[M];
int main(){
cin>>n>>m;
for(int i=1;i<=n;i++)
p[i]=i;
int k=0,res=0;
for(int i=0;i<m;i++){
int t,a,b,c;
cin>>t>>a>>b>>c;
if(t==1){
p[find(a)]=find(b);
res+=c;
}
else
edges[k++]={a,b,c};
}
sort(edges,edges+k);
for(int i=0;i<k;i++){
int a=find(edges[i].a),b=find(edges[i].b),c=edges[i].dist;
if(a!=b){
p[a]=b;
res+=c;
}
}
cout<<res<<endl;
return 0;
}