#include <iostream>
#include<fstream>
#include<vector>
#include<queue>
#define mx 50005
#define inf 0x3f3f3f3f
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
vector<int> v[mx],c[mx];
queue<int> q;
int n,m,cost[mx];
void citire()
{
    int i,x,y,co;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>co;
        v[x].push_back(y);
        c[x].push_back(co);
    }
}
void dj()
{
    q.push(1);
    cost[1]=0;
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(unsigned int i=0;i<v[nod].size();++i)
        if(cost[v[nod][i]]>cost[nod]+c[nod][i])
        {
            cost[v[nod][i]]=cost[nod]+c[nod][i];
            q.push(v[nod][i]);
        }
    }
}
int main()
{
    int i;
    citire();
    for(i=1;i<=n;i++)
        cost[i]=inf;
    dj();
    for(i=2;i<=n;i++)
    if(cost[i]!=inf)
        fout<<cost[i]<<" ";
    else fout<<"0 ";
    return 0;
}