#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<queue>

 #define int long long

 #define maxn 200000+10

 #define INF 2147483647

 using namespace std;

 inline int read()

 {

     int x=;

     bool f=;

     char c=getchar();

     for(; !isdigit(c); c=getchar()) if(c=='-') f=;

     for(; isdigit(c); c=getchar()) x=(x<<)+(x<<)+c-'';

     if(f) return x;

     return -x;

 }

 inline void write(long long x)

 {

     if(x<){putchar('-');x=-x;}

     if(x>)write(x/);

     putchar(x%+'');

 }

 int n,m,c,max_d=-INF,ans,sum,cnt;

 int head[*maxn],book[maxn],vis[maxn];

 struct node

 {

     int u,v,w,nex;

 }edge[*maxn];

 struct node1

 {

     int dis,num;

 }x[maxn];

 inline bool cmp(node1 x,node1 y)

 {

     return x.dis<y.dis;

 }

 inline void add(int x,int y,int z)

 {

     edge[++cnt].u=x;

     edge[cnt].v=y;

     edge[cnt].w=z;

     edge[cnt].nex=head[x];

     head[x]=cnt;

 }

 inline void dijkstra()

 {

     priority_queue<pair<int,int> > q;

     for(int i=;i<=n;i++) x[i].dis=INF;

     memset(book,,sizeof(book));

     x[].dis=;

     q.push(make_pair(,));

     while(!q.empty())

     {

         int from=q.top().second;

         q.pop();

         if(book[from]) continue;

         book[from]=;

         for(int i=head[from];i;i=edge[i].nex)

         {

             int to=edge[i].v,val=edge[i].w;

             if(x[to].dis>x[from].dis+val)

             {

                 x[to].dis=x[from].dis+val;

                 q.push(make_pair(-x[to].dis,to));

             }

         }

     }

 }

 signed main()

 {

     n=read();m=read();c=read();

     for(int i=;i<=m;i++)

     {

         int x=read(),y=read(),z=read();

         add(x,y,z);

         add(y,x,z);

         sum+=z;

     }

     dijkstra();

     for(int i=;i<=n;i++) x[i].num=i;

     sort(x+,x+n+,cmp);

     vis[]=;

     int ans=sum;

     for(int i=;i<=n;i++)

     {

         vis[x[i].num]=;

         for(int j=head[x[i].num];j;j=edge[j].nex)

             if(vis[edge[j].v])

                 sum-=edge[j].w;

         ans=min(ans,sum+x[i].dis*c);

     }

     write(ans);

     return ;

 }