#include <bits/stdc++.h>

#define NMAX  1005
#define KMAX  11
#define INF 1e9
using namespace std;

ifstream fin ("retea.in");
ofstream fout ("retea.out");


double D[NMAX][KMAX];

vector < pair <int, double > > G[NMAX];

struct cmp{

    bool operator()(const int &a, const int &b){
        return D[a][0] > D[b][0];
    }
};

priority_queue < int , vector < int > , cmp > heap;

void dijkstra(){
    int nod;
    heap.push(1);
    while(!heap.empty()){
        nod = heap.top();
        heap.pop();
        for(int i = 0; i < G[nod].size(); i++){
            if(D[G[nod][i].first][0] >  D[nod][0] + G[nod][i].second){
                D[G[nod][i].first][0] = D[nod][0] + G[nod][i].second;
                heap.push(G[nod][i].first);
            }
        }
    }
}


int main()
{
    ios :: sync_with_stdio(false);
    fin.tie(NULL);

    int n,m,x,y,c,K;

    fin >> n >> m >> K;

    for(int i = 1; i <= m; i++){
        fin >> x >> y >> c;
        G[x].push_back({y,c});
        G[y].push_back({x,c});
    }
    for(int i = 2; i <= n; i++)
        D[i][0] = INF;
    dijkstra();

    for(int k = 1; k <= K; k++){
        for(int i = 2; i <= n; i++)
            D[i][k] = INF;
        for(int i = 1; i <= n; i++)
            for(int q = 1; q <= k; q++)
                for(int j = 0; j < G[i].size(); j++){
                        D[i][k] = min(D[G[i][j].first][k - q] + G[i][j].second / (1 << q),D[i][k]);
                }
    }

    for(int i = 1; i <= n; i++)
        fout << D[i][K] << " ";

    return 0;
}