#include <bits/stdc++.h>

using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n,m,dp[50005];
const int inf = 2000000000;
struct el
{
    int nod,cost;
    bool operator < (const el &A) const
    {
        return cost > A.cost;
    }
};
priority_queue <el> q;
vector <int> G[50005],C[50005];
el A,B;
inline void Read()
{
    int i,x,y,z;
    fin>>n>>m;
    for(i = 2; i <= n; i++) dp[i] = inf;
    for(i = 1; i <= m; i++)
    {
        fin>>x>>y>>z;
        G[x].push_back(y);
        C[x].push_back(z);
    }
}
inline void BFS()
{
    int i,j,nod,cost;
    A.cost = 0, A.nod = 1;
    q.push(A);
    while(!q.empty())
    {
        A = q.top();
        nod = A.nod;
        q.pop();
        for(i = 0; i < G[nod].size(); i++)
        {
            if(dp[G[nod][i]] != inf) continue;
            cost = dp[nod]+C[nod][i];
            dp[G[nod][i]] = cost;
            B.nod = G[nod][i];
            B.cost = dp[G[nod][i]];
            q.push(B);

        }
    }
}

inline void Output()
{
    for(int i = 2; i <= n; i++) (dp[i] == inf ? fout << 0 << " " : fout << dp[i] << " ");
    fout<<"\n";
    fout.close();
}

int main()
{
    Read();
    BFS();
    Output();
    return 0;
}