#include<cstdio>
#include<vector>
#include<queue>
#include<cmath>
using namespace std;
typedef pair<long long,int>pii;
const long long INF=1e18;
vector<vector<pii> >g;
vector<long long>d;
priority_queue<pii,vector<pii>,greater<pii> >q;
int n,m;
int main()
{
    long long t=INF;
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    scanf("%d%d",&n,&m);
    g.resize(n+1);
    for (int i=1;i<=m;++i)
    {
        int x,y,z;
        scanf("%d%d%d",&x,&y,&z);
        g[x].push_back(pii(y,z));
    }
    d.resize(n+1,INF);
    d[1]=0;
    q.push(pii(0,1));
    while(!q.empty())
    {
        int v=q.top().second;
        int cur_d=q.top().first;
        q.pop();
        if (d[v]<cur_d) continue;
        for (int i=0;i<g[v].size();++i)
        {
            int u=g[v][i].first;
            int w=g[v][i].second;
            if (d[u]>d[v]+w)
            {
                d[u]=d[v]+w;
                q.push(pii(d[u],u));
            }
        }
    }
    for (int i=2;i<=n;++i)
       if (d[i]!=t) printf("%d ",d[i]);
            else printf("0 ");
    return 0;
}