#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream cin ("dijkstra.in");
ofstream cout ("dijkstra.out");

int n,m,x,y,c,d[50100],p,t;
vector<pair<int,int>>v[50100];
priority_queue<pair<int,int>>Q;
int main()
{
    cin>>n>>m;
    while (m)
    {
        m--;
        cin>>x>>y>>c;
        v[x].push_back({y,c});
    }

    for (int i=1; i<=n; i++)
    d[i]=1000000000;

    d[1]=0;
    Q.push(make_pair(0,1));

    while (!Q.empty())
    {
        x=Q.top().second;
        t=Q.top().first*-1;
        Q.pop();

        if (d[x]==t)
        for (auto i:v[x])
        {
            y=i.first;
            p=i.second;

            if (d[y]>d[x]+p)
            {
                d[y]=d[x]+p;
                Q.push({d[y]*-1,y});
            }

        }


    }

    for (int i=2; i<=n; i++)
    if (d[i]==1000000000) cout<<0<<" ";
    else cout<<d[i]<<" ";
    return 0;
}