const int MAXN=5e4+5,MAXM=1e5+5,MAXW=105;
struct Edge{
	int u,v,w,c;
	bool operator < (const Edge &b)const{
		return w<b.w||(w==b.w&&c<b.c);
	}
}edge[MAXM];
int p[MAXN];
int Find(int x){
	return x==p[x]?x:p[x]=Find(p[x]);
}
pair<int,int> solve(int n,int m,int w){
	_rep(i,1,n)p[i]=i;
	_for(i,0,m){
		if(!edge[i].c)
		edge[i].w-=w;
	}
	sort(edge,edge+m);
	int s1=0,s2=0;
	_for(i,0,m){
		int x=Find(edge[i].u),y=Find(edge[i].v);
		if(x!=y){
			p[x]=y;
			s1+=edge[i].w;
			s2+=edge[i].c==0;
		}
	}
	_for(i,0,m){
		if(!edge[i].c)
		edge[i].w+=w;
	}
	return make_pair(s1,s2);
}
int main(){
	int n=read_int(),m=read_int(),k=read_int();
	_for(i,0,m){
		edge[i].u=read_int()+1;
		edge[i].v=read_int()+1;
		edge[i].w=read_int();
		edge[i].c=read_int();
	}
	int lef=-MAXW,rig=MAXW,ans;
	while(lef<=rig){
		int mid=lef+rig>>1;
		if(solve(n,m,mid).second>=k){
			ans=mid;
			rig=mid-1;
		}
		else
		lef=mid+1;
	}
	enter(solve(n,m,ans).first+ans*k);
	return 0;
}