#include <bits/stdc++.h>

using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
const int N = 50010;
const int oo = 1000000007;
int n,m,x,y,c,d[N],cnt[N];
queue<int> Q;
bitset<N> q;
vector<pair<int,int>> v[N];
bool p;
int main()
{
    f>>n>>m;
    for(;m;m--)
    {
        f>>x>>y>>c;
        v[x].push_back(make_pair(y,c));
    }
    fill(d+2,d+n+1,oo);
    Q.push(1);
    q[1]=1;
    while(Q.size())
    {
        x=Q.front();
        for(auto it:v[x])
        {
            tie(y,c)=it;
            if(d[y]>d[x]+c)
            {
                d[y]=d[x]+c;
                if(!q[y]){Q.push(y);q[y]=1;}
            }
        }
        Q.pop();
        q[x]=0;
    }
    for(int i=2;i<=n;i++)
    {
        if(d[i]==oo)d[i]=0;
        g<<d[i]<<' ';
    return 0;
}