#include<iostream>
#include<cstdio>
#include<algorithm>
#define ll long long
#define N 500005
using namespace std;
struct node{
	int a,b;
	ll c;
}e[N];
ll sum=0LL;
int f[N],n,m,k;
bool p[N];
bool cmp(node x,node y){
	return x.c>y.c;
}inline int find(int x){
	if(f[x]==x)return x;
	return f[x]=find(f[x]);
}int main(){
	scanf("%d%d%d",&n,&m,&k);
	for(int i=1;i<=n;i++)f[i]=i;
	for(int i=1;i<=m;i++)scanf("%d%d%lld",&e[i].a,&e[i].b,&e[i].c);
	sort(e+1,e+m+1,cmp);
	for(int i=1;i<=m;i++){
		int u=find(e[i].a),v=find(e[i].b);
		if(u!=v&&(p[u]+p[v]<!k+1)||(k==0&&!p[u]&&u==v)){
			p[v]=(p[u]||p[v]||(u==v)),f[u]=v,sum+=e[i].c;
		}
	}printf("%lld",sum);
	return 0;
}