#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mod 1000000007

using namespace std;

typedef long long ll;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int n, m, dist[4][200002];
bool was[200002];
vector<pair<int, int> >v[200002];

struct cmp
{
    bool operator()(pair<int, int> a, pair<int, int> b)
    {
        return dist[a.first][a.second] > dist[b.first][b.second];
    }
};
priority_queue<pair<int, int>, vector<pair<int, int> >, cmp>q;
void djk(int src, int st)
{
    for(int i = 1; i <= n; ++i)
        dist[src][i] = (1<<30), was[i] = 0;
    dist[src][st] = 0;
    q.push({src, st});
    while(!q.empty())
    {
        pair<int, int> nod = q.top();
        q.pop();
        if(was[nod.second])
            continue;
        was[nod.second] = 1;
        for(int i = 0; i < v[nod.second].size(); ++i)
        {
            pair<int, int> vecin = v[nod.second][i];
            if(dist[nod.first][nod.second] + vecin.second < dist[nod.first][vecin.first])
            {
                dist[nod.first][vecin.first] = dist[nod.first][nod.second] + vecin.second;
                q.push({nod.first, vecin.first});
            }
        }
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    f >> n >> m;
    for(int i = 1; i <= m; ++i)
    {
        int a, b, c;
        f >> a >> b >> c;
        v[a].pb({b, c});
       // v[b].pb({a, c});
    }
    djk(1, 1);
    for(int i = 2; i <= n; ++i)
    {
        if(dist[1][i] == (1<<30))
            dist[1][i] = 0;
       g << dist[1][i] << " ";
    }
    g << '\n';
    return 0;
}