#include <fstream>
#include <queue>
#define INF 99999
using namespace std;

ifstream in("dijkstra.in");
ofstream out("dijkstra.out");
queue<int> Q;
vector<int> V[50000];
vector<int> C[50000];
int D[50000];
bool Uz[50000];
int main()
{
    int N,M,x,y,c,i;
    in>>N>>M;
    while(M--)
    {
        in>>x>>y>>c;
        V[x].push_back(y);
        C[x].push_back(c);
    }
    for(i=2;i<=N;i++) D[i] = INF;
    //dijkstra
    Q.push(1);
    while(!Q.empty())
    {
        x = Q.front();
        Q.pop();
        Uz[x] = 1;
        for(i=0;i<V[x].size();i++)
        {
            y = V[x][i];
            c = C[x][i];
            if(D[x]+c<D[y])
            {
                D[y] = D[x] + c;
                if(Uz[x])
                Q.push(y);

            }
        }
    }
    for(i=2;i<=N;i++)
        if(D[i]==INF)
        out<<"0 ";
        else out<<D[i]<<' ';
    return 0;
}