#include <bits/stdc++.h>

    using namespace std;

    ifstream fin("dijkstra.in");
    ofstream fout("dijkstra.out");

vector<int> v[50100];
vector<int> c[50100];
priority_queue < pair<int,int> , vector <pair<int, int> >, greater <pair<int, int> > > pq;
int g[50100];
int n,m,dist;

void dijkstra(int nod)
{
    g[nod]=0;

    pq.push(make_pair(0,nod));

    while(!pq.empty())
    {
        nod=pq.top().second;
        dist=pq.top().first;
        pq.pop();

        for(int i=0;i<v[nod].size();i++)
        {
            if(g[v[nod][i]]>dist+c[nod][i])
                g[v[nod][i]]=dist+c[nod][i];

            pq.push(make_pair(g[v[nod][i]],v[nod][i]));
        }
    }
}

int main()
{
    int x,y,cost;

    fin>>n>>m;

    for(int i =1;i<=m;i++)
    {
        fin>>x>>y>>cost;
        v[x].push_back(y);
        c[x].push_back(cost);
    }


    for(int i=1; i<=n;i++)
        g[i]=(1<<30)-1;

    dijkstra(1);

    for(int i=2;i<=n;i++)
        if(g[i]==(1<<30)-1)fout<<0<<' ';
        else fout<<g[i]<<' ';


}