#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
vector<int>v[50005],c[50005];
queue<int>q;
int n,m,x,a,b,y,d[50005];
int main()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        cin>>a>>b>>y;
        v[a].push_back(b);
        c[a].push_back(y);
    }
    q.push(1);
    d[1]=1;
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        for(int i=0;i<v[x].size();i++)
        {
            int cost=c[x][i];
            y=v[x][i];
            if(d[y]==0)
            {
                d[y]=d[x]+cost;
                q.push(y);
            }
            if(d[x]+cost<d[y])
            {
                d[y]=d[x]+cost;
                q.push(y);
            }
        }
    }
    for(int i=2;i<=n;i++)
        cout<<max(d[i]-1,0)<<" ";
    return 0;
}