#include <iostream>

 #include <cstdio>

 #include <cstring>

 #include <cstdlib>

 #include <algorithm>

 #include <queue>

 #include <vector>

 #include <map>

 #include <string>

 #include <cmath>

 #define min(a, b) ((a) < (b) ? (a) : (b))

 #define max(a, b) ((a) > (b) ? (a) : (b))

 #define abs(a) ((a) < 0 ? (-1 * (a)) : (a))

 template<class T>

 inline void swap(T &a, T &b)

 {

     T tmp = a;a = b;b = tmp;

 }

 inline void read(int &x)

 {

     x = ;char ch = getchar(), c = ch;

     while(ch < '' || ch > '') c = ch, ch = getchar();

     while(ch <= '' && ch >= '') x = x *  + ch - '', ch = getchar();

     if(c == '-') x = -x;

 }

 const int INF = 0x3f3f3f3f;

 const int MAXN =  + ;

 const int MAXM =  + ;

 struct Edge

 {

     int u,v,w,nxt;

     Edge(int _u, int _v, int _w, int _nxt){u = _u, v = _v, w = _w, nxt = _nxt;}

     Edge(){}

 }edge[MAXM << ];

 int head[MAXN], cnt = , d[MAXN][MAXN], dis[MAXM], flag, belong[MAXM][MAXN], vis[MAXN], p[MAXN][MAXN], l, tmp1, tmp2, tmp3, n, m;

 //p[i]表示以i为起点的最短路树，在最短路树上，j的父亲的那条边

 inline void insert(int a, int b, int c)

 {

     edge[++ cnt] = Edge(a,b,c,head[a]), head[a] = cnt;

 }

 struct Node

 {

     int u,w;

     Node(int _u, int _w){u = _u, w = _w;}

     Node(){}

 };

 struct cmp

 {

     bool operator()(Node a, Node b)

     {

         return a.w > b.w;

     }

 };

 std::priority_queue<Node, std::vector<Node>, cmp> q;

 void dij(int S, int *d, int size)

 {

     while(q.size())q.pop();memset(d, 0x3f, size), d[S] = , memset(vis, , sizeof(vis)), q.push(Node(S, ));

     while(q.size())

     {

         Node now = q.top();q.pop();

         if(vis[now.u]) continue; vis[now.u] = ;

         for(int pos = head[now.u];pos;pos = edge[pos].nxt)

         {

             int v = edge[pos].v;

             if(d[v] > d[now.u] + edge[pos].w)

             {

                 d[v] = d[now.u] + edge[pos].w, q.push(Node(v, d[v]));

                 if(flag) p[S][v] = pos;

             }

         }

     }

 }

 int main()

 {

     while(scanf("%d %d %d", &n, &m, &l) != EOF)

     {

         flag = , memset(head, , sizeof(head)), memset(belong, , sizeof(belong)), memset(p, , sizeof(p)), cnt = ;

         for(int i = ;i <= m;++ i) read(tmp1), read(tmp2), read(tmp3), insert(tmp1, tmp2, tmp3), insert(tmp2, tmp1, tmp3);

         for(int i = ;i <= n;++ i) dij(i, d[i], sizeof(d[i]));

         long long ans1 = , ans2 = ans1, ans3 = ;

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

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

                 if(d[i][j] >= INF) ans1 += l;

                 else ans1 += d[i][j];

         printf("%lld ", ans1);

         flag = ans3 = ;

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

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

                 if(p[i][j]) belong[p[i][j]][i] = ;

         for(int pos = ;pos <= cnt;pos += )

         {

             tmp1 = edge[pos].w;ans2 = ans1;

             edge[pos].w = edge[pos ^ ].w = INF;

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

                 if(belong[pos][S] || belong[pos^][S])

                 {

                     dij(S, dis, sizeof(dis));

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

                     {

                         if(d[S][i] >= INF) ans2 -= l;

                         else ans2 -= d[S][i];

                         if(dis[i] >= INF) ans2 += l;

                         else ans2 += dis[i];

                     }

                 }

             edge[pos].w = edge[pos ^ ].w = tmp1;

             ans3 = max(ans3, ans2);

         }

         printf("%lld\n", ans3);

     }

     return ;

 }