#include <bits/stdc++.h>

using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
typedef long long ll;
typedef pair<int,int> pii;
const ll INF=1e12;
int n,m;
ll dist[50005];
bool use[50005];
vector<pii> muchii[50005];
struct comp
{
    bool operator ()(pii a, pii b)
    {
        return a>b;
    }
};
priority_queue<pii,vector<pii>,comp> pq;
void bfs()
{
    for(int i=1;i<=n;i++)
    {
        dist[i]=INF;
        use[i]=0;
    }
    dist[1]=0;
    pq.push({0,1});
    while(!pq.empty())
    {
        int nod=pq.top().second;
        pq.pop();
        if(use[nod])
            continue;
        use[nod]=1;
        for(pii z:muchii[nod])
        {
            int fiu=z.first;
            ll cost=dist[nod]+z.second;
            if(cost<dist[fiu])
            {
                dist[fiu]=cost;
                pq.push({dist[fiu],fiu});
            }
        }
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    fin.tie(0);
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int a,b,c;
        fin>>a>>b>>c;
        muchii[a].push_back({b,c});
    }
    bfs();
    for(int i=2;i<=n;i++)
    {
        if(dist[i]!=INF)
            fout<<dist[i]<<' ';
        else
            fout<<0<<' ';
    }
    return 0;
}