#include <bits/stdc++.h>

using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
typedef pair<int,int> pii;
const int INF=1e9+1;
int n,m;
vector<pii> muchii[50005];
int dist[50005];
priority_queue<pii,vector<pii>,greater<pii> > coada;
bool use[50005];
void dij()
{
    for(int i=2;i<=n;i++)
        dist[i]=INF;
    coada.push({0,1});
    while(!coada.empty())
    {
        int nod=coada.top().second;
        coada.pop();
        if(use[nod])
            continue;
        use[nod]=1;
        for(pii a:muchii[nod])
        {
            int who=a.first;
            int c=a.second;
            if(dist[who]>dist[nod]+c&&!use[who])
            {
                dist[who]=dist[nod]+c;
                coada.push({dist[who],who});
            }
        }
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    fin.tie(0);
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int a,b,c;
        fin>>a>>b>>c;
        muchii[a].push_back({b,c});
    }
    dij();
    for(int i=2;i<=n;i++)
    {
        if(dist[i]==INF)
            fout<<0<<' ';
        else
            fout<<dist[i]<<' ';
    }
    return 0;
}