#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
const int NMAX=50004;
const int inf=20000000;
using namespace std;
vector<int> dr[NMAX];
vector<int> lg[NMAX];
queue<int> q;
int minn[NMAX];
void dijkstra()
{
    q.push(1);
    int x,n,i;
    while(q.size())
    {
        x=q.front();
        q.pop();
        n=dr[x].size();
        for(i=0;i<n;++i)
        {
            if(minn[dr[x][i]]>minn[x]+lg[x][i])
            {
                minn[dr[x][i]]=minn[x]+lg[x][i];
                q.push(dr[x][i]);
            }
        }
    }
}
int main()
{
    ifstream si;
    si.open("dijkstra.in");
    ofstream so;
    so.open("dijkstra.out");
    int n,m;
    si>>n>>m;
    int a,b,c,i;
    for(i=0;i<m;++i)
    {
        si>>a>>b>>c;
        dr[a].push_back(b);
        lg[a].push_back(c);
    }
    for(i=2;i<=n;++i)
        minn[i]=inf;
    dijkstra();
    for(i=2;i<=n;++i)
        if(minn[i]==inf)
            so<<0<<' ';
        else
            so<<minn[i]<<' ';
    so<<'\n';
}