#include <fstream>
#include <queue>
#include <climits>
#include <vector>
using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

int n,x,y,m,c;
struct a
{
    int x, y;
};
vector <a> v[50001];
queue <int> Q;
int d[50001];
bool a[50001];

void dijkstra()
{
    for(int i=2; i<=n; ++i)
        d[i]=INT_MAX;
    d[1]=0;
    a[1]=0;
    while(!Q.empty())
    {
        int r=Q.front();
        for(int i=0; i<v[r].size(); ++i)
        {
            int w=v[r][i].x;
            int t=v[r][i].y;
            if(d[r]+t<d[w])
            {
                a[w]=1;
                d[w]=d[r]+t;
                Q.push(w);
            }
        }
        Q.pop();
    }
}

int main()
{
    f>>n>>m;
    for(int i=1; i<=m; ++i)
    {
        f>>x>>y>>c;
        v[x].push_back({y,c});
    }
    Q.push(1);
    dijkstra();
    for(int i=2; i<=n; ++i)
    {
        if(a[i])
            g<<d[i]<<" ";
        else
            g<<0<<" ";
    }
    return 0;
}