#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define inf 1000000007
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
vector < pair<int,int> > v[50005];
int n, m, x, y, c;
long long dp[50005];

void bf()
{
    int i,j,x;
    queue<int>q;

    for(i=1; i<=n; i++)
        dp[i] = inf;

    dp[1] = 0;
    q.push(1);
    while(q.size()!=0)
    {
        x = q.front();
        for(auto it: v[x])
        {
            if(dp[it.second] > dp[x] + it.first)
            {
                dp[it.second] = dp[x] + it.first;
                q.push(it.second);
            }
        }
        q.pop();
    }
}

int main()
{
    int i;
    fin>>n>>m;
    for(i=1; i<=m; i++)
    {
        fin>>x>>y>>c;
        v[x].push_back({c, y});
    }
    bf();
    for(i=2; i<=n; i++)
    {
        fout<<dp[i]<<" ";
    }


    fin.close();
    fout.close();
    return 0;
}