#include <bits/stdc++.h>
#include <queue>
#define ll long long

using namespace std;

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

const int nmax=50000;
const int mmax=250000;
const ll INF=LONG_MAX;
int n,m,a,b,c;
priority_queue<pair<ll,int> > pq;
vector<pair<int,int> > vecini[nmax+2];
bool vizitat[nmax+3];
ll d[nmax+2];

void dijkstra()
{
    pq.push({0,1});
    while(!pq.empty())
    {
        int i=pq.top().second;
        int costi=-pq.top().first;
        pq.pop();
        if(costi==d[i])
        {
            for(auto nod: vecini[i])
            {
                int pi=nod.first;
                int cost=nod.second;
                if(d[pi]>d[i]+cost)
                {
                    d[pi]=d[i]+cost;
                    pq.push({-d[pi],pi});
                }
            }
        }

    }
}

int main()
{
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        fin>>a>>b>>c;
        vecini[a].push_back({b,c});
    }
    for(int i=2; i<=n; i++) d[i]=LONG_MAX;
    dijkstra();
    for(int i=2; i<=n; i++)
    {
        if(d[i]==LONG_MAX) fout<<"0 ";
        else fout<<d[i]<<" ";
    }
    return 0;
}