#include<bits/stdc++.h>
#define ll long long
#define A 10000000
using namespace std;
struct edge{
    ll x,y,z,id;
    ll flag;
}e[A];
ll n,m,need,fa[A],zong,ans,end[A];
inline ll read()
{
    ll f=1,x=0;char c=getchar();
    while(!isdigit(c)){if(c==‘-‘) f=-1;c=getchar();}
    while(isdigit(c)){x=x*10+c-‘0‘;c=getchar();}
    return f*x;
}
ll find(ll x)
{
    if(fa[x]!=x) fa[x]=find(fa[x]);
    return fa[x];
}
void hebing(ll x,ll y)
{
    x=find(x),y=find(y);    if(x!=y) fa[y]=x;
}
bool cmp(edge a,edge b){return (a.z==b.z)?(a.flag<b.flag):(a.z<b.z);}
inline void kuskar(ll mid)
{
    for(ll i=0;i<=n;i++)
        fa[i]=i;
    zong=0,ans=0;
    for(ll i=1;i<=m;i++)
    if(!e[i].flag)
        e[i].z+=mid;
    sort(e+1,e+m+1,cmp);
    for(ll i=1;i<=m;i++)
    {
        if(find(e[i].x)!=find(e[i].y))
        {
            if(!e[i].flag)
                zong++;
            hebing(e[i].x,e[i].y);
            ans+=e[i].z;
        }
    }
    for(ll i=1;i<=m;i++)
        if(!e[i].flag)
            e[i].z-=mid;
}
int main()
{
    ll tot=0;
    n=read(),m=read(),need=read();
    for(ll i=1;i<=m;i++)
        e[i].x=read(),e[i].y=read(),e[i].z=read(),e[i].flag=read();
    ll l=-100,r=100;
    while(l<=r)
    {
        ll mid=(l+r)>>1;
        kuskar(mid);
        if(zong>=need) l=mid+1,tot=ans-need*mid;
        else r=mid-1;
    }
    cout<<tot<<endl;
}