#include <bits/stdc++.h>
using namespace std;

int viz[100000],n,m,i,x,y,c,d[100000];
priority_queue < int, vector<int>, greater<int> > pq;
vector < pair<int,int> > G[100000];
int inf=2000000000;

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

void dijkstra(int S)
{
    int i;
    for(i=1;i<=n;i++)
        d[i]=inf;
    d[S]=0;
    pq.push(S);
    viz[S]=1;

    while(!pq.empty())
    {
        int nod=pq.top();
        pq.pop();

        viz[nod]=0;
        for(auto& it : G[nod])
        {
            int nc=it.first;
            int cost=it.second;

            if(d[nod] + cost < d[nc])
            {
                d[nc] = d[nod] + cost;
                if(viz[nc]==0)
                {
                    pq.push(nc);
                    viz[nc]=1;
                }
            }
        }
    }
}

int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>c;
        G[x].push_back(make_pair(y,c));
    }

    dijkstra(1);

    for(i=2;i<=n;i++)
    {
        if(d[i]!=inf)
            g<<d[i]<<" ";
        else g<<0<<" ";
    }

    f.close();
    g.close();
    return 0;
}