#include <cstdio>
#include <algorithm>
using namespace std;
const int N=40010;
struct edge{
    int from,to,w;
    edge(){}
    edge(int from,int to,int w):from(from),to(to),w(w){}
}e[N];
int pre[N],now[300],n,m,c,tail,rudu[300],chudu[300],s,t,v;
long long ans;
void add(int u,int v,int argw){
    e[++tail]=edge(u,v,argw);pre[tail]=now[u];now[u]=tail;
}
bool cmp(edge a,edge b){return a.w<b.w;}

int main(){
    freopen("asm_lis.in","r",stdin);freopen("asm_lis.out","w",stdout);
    scanf("%d%d%d",&n,&m,&c);
    for(int i=1;i<=m;i++) {
        scanf("%d%d%d",&s,&t,&v);
        if(v>c) continue;else add(s,t,v);
    }
    for(int i=1;i<=n;i++) add(0,i,c);
    sort(e+1,e+tail+1,cmp);
    for(int i=1;i<=tail;i++) {
        if((chudu[e[i].from]<1 || !e[i].from)&& rudu[e[i].to]<1) ans+=e[i].w,chudu[e[i].from]++,rudu[e[i].to]++;
    }
    printf("%lld",ans);
    return 0;
}