#include <fstream>
#include <vector>
#include <queue>
#define inf 2000000000
using namespace std;
ifstream fin ("dijkstra.in");
ofstream fout ("dijkstra.out");
int n,m,a,b,c,d[50010];
vector< pair<int,int> > v[50010];
pair<int,int> t;
priority_queue < pair<int,int>,vector< pair<int,int> >, greater< pair<int,int> > >pq;
int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
        d[i]=inf;
    d[1]=0;
    for(;m;m--)
    {
        fin>>a>>b>>c;
        v[a].push_back(make_pair(c,b));
        if(a==1)
        {
            pq.push(make_pair(c,b));
            d[b]=c;
        }
    }

    while(!pq.empty())
    {
        t=pq.top();
        pq.pop();
        if(t.first==d[t.second])
        {
            for(auto it:v[t.second])
            {
                if(d[it.second]>d[t.second]+it.first)
                {
                    d[it.second]=d[t.second]+it.first;
                    pq.push(make_pair(d[it.second],it.second));
                }
            }
        }
    }
    for(int i=2;i<=n;i++)
    {
        if(d[i]==inf)
            fout<<0<<" ";
        else
            fout<<d[i]<<" ";
    }
    return 0;
}