#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<map>
#include<vector>
using namespace std;
int m,n,s,t,v,c;
int dist[10005];
bool bb[255][255]={0},vis[255];
struct date{
	int to,dis;
}d;
vector<date>p[10005];
queue<int>q;
int main()
{
	freopen("asm_lis.in","r",stdin);
	freopen("asm_lis.out","w",stdout);
	int sum=1,ans=0;
	cin>>n>>m>>c;
	for(int i=1;i<=m;i++)
	{
		cin>>s>>t>>v;
		d.to=t;d.dis=v;
		if(c<v)sum++;else ans+=v;
		 p[s].push_back(d);
	}
	ans+=sum*c;
	cout<<ans<<endl;
	return 0;
}