#include <iostream>

#include <cstdio>

#include <cstring>

#include <queue>

#define maxn 2222

typedef long long ll;

using namespace std;

struct heapnode{

    ll D,U;

    bool operator < (heapnode ND) const {

        return D>ND.D;

    }

};

ll inf=~0U>>;

ll to[maxn],c[maxn],next[maxn],first[maxn],edge;

ll u[maxn],v[maxn],w[maxn],minlen[maxn][maxn],tim[maxn][maxn];

ll dis[maxn],from[maxn],C[maxn],f[maxn][maxn];

bool key[maxn],akey[maxn],done[maxn];

ll n,m,L,ans,sum;

void _init()

{

    edge=-,sum=ans=;

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

    {

        first[i]=-,C[i]=;

        for (int j=; j<=n; j++) minlen[i][j]=inf;

        for (int j=; j<=m; j++) f[i][j]=;

    }

}

void addedge(int U,int V,int W)

{

    edge++;

    to[edge]=V,c[edge]=W,next[edge]=first[U],first[U]=edge;

    edge++;

    to[edge]=U,c[edge]=W,next[edge]=first[V],first[V]=edge;

}

ll dijkstra(int S,int EG,ll Dis[],ll From[],bool Key[])

{

    priority_queue<heapnode> Q;

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

    {

        if (i<=n) Dis[i]=inf,From[i]=-,done[i]=false;

        if (i<=m) Key[i]=false;

    }

    Dis[S]=;

    Q.push((heapnode){,S});

    while (!Q.empty())

    {

        heapnode ND=Q.top();

        Q.pop();

        int cur=ND.U;

        if (done[cur]) continue;

            else done[cur]=true;

        if (From[cur]!=-) Key[From[cur]/+]=true;

        for (int i=first[cur]; i!=-; i=next[i])

            if (i!=EG+EG- && i!=EG+EG- && Dis[cur]+c[i]<Dis[to[i]])

            {

                Dis[to[i]]=Dis[cur]+c[i];

                From[to[i]]=i;

                Q.push((heapnode){Dis[to[i]],to[i]});

            }

    }

    ll tot=;

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

        if (Dis[i]!=inf) tot+=Dis[i];

            else tot+=L;

    return tot;

}

int main()

{

    inf*=inf;

    while (scanf("%lld%lld%lld",&n,&m,&L)!=EOF)

    {

        _init();

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

        {

            scanf("%lld%lld%lld",&u[i],&v[i],&w[i]);

            addedge(u[i],v[i],w[i]);

            if (w[i]<minlen[u[i]][v[i]]) minlen[u[i]][v[i]]=minlen[v[i]][u[i]]=w[i],tim[u[i]][v[i]]=tim[v[i]][u[i]]=;

                else if (w[i]==minlen[u[i]][v[i]]) tim[u[i]][v[i]]++,tim[v[i]][u[i]]++;

        }

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

        {

            C[i]=dijkstra(i,m+,dis,from,key);

            ans+=C[i];

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

                if (!key[j] || tim[u[j]][v[j]]> || minlen[u[j]][v[j]]!=w[j]) f[i][j]=C[i];

                else f[i][j]=dijkstra(i,j,dis,from,akey);

        }

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

        {

            ll tmp=;

            for (ll j=; j<=n; j++) tmp+=f[j][i];

            sum=max(sum,tmp);

        }

        printf("%lld %lld\n",ans,sum);

    }

    return ;

}