#include<bits/stdc++.h>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

struct elem
{
    int destinatie,cost;
    bool operator<(const elem &other)const
    {
        return cost>other.cost;
    }
};
int n,m,dist[50005],viz[50005],ans[50005];

priority_queue<int>q;

vector<elem>v[50005];

void  dij(int val)
{
    int i;
    dist[val]=0;
    q.push(val);
    viz[val]=1;
    while(!q.empty())
    {
        int nod=q.top();
        viz[nod]=0;
        q.pop();
        for(i=0; i<v[nod].size(); i++)
        {
            int dest=v[nod][i].destinatie;
            if(dist[dest]>v[nod][i].cost+dist[nod])
            {
                dist[dest]=v[nod][i].cost+dist[nod];
                if(viz[dest]==0)
                {
                    viz[dest]=1;
                    q.push(dest);
                }
            }
        }
    }
    for(i=2; i<=n; i++)
        {
            if(dist[i]==INT_MAX)
                fout<<0<<" ";
            else
            fout<<dist[i]<<" ";
        }
}

int main()
{
    int i,x,y,z;
    fin>>n>>m;
    for(i=1; i<=m; i++)
    {
        fin>>x>>y>>z;
        v[x].push_back({y,z});
    }
    for(i=2; i<=n; i++)
        dist[i]=INT_MAX;
    dij(1);
    return 0;
}