#include<bits/stdc++.h>
#define INF INT_MAX
#define maxN 50005
using namespace std;
typedef struct edge
{
  int nod,cost;
  bool operator<(const edge& other) const {
        return cost > other.cost;
    }
};
priority_queue<edge> q;
vector<pair<int,int> > v[maxN];
int dp[maxN],n,m,x,y,c;
void Dijkstra()
{
    while(!q.empty())
    {
        int x=q.top().nod;
        int y=q.top().cost;
        q.pop();
        if(y>dp[x]) continue;
        for(vector<pair<int,int> >::iterator it=v[x].begin();it!=v[x].end();it++)
        {
            int sum=y+(*it).second;
            if(sum<dp[(*it).first])
            {
                dp[(*it).first]=sum;
                q.push({(*it).first,dp[(*it).first]});
            }
        }
    }
}
int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d%d",&x,&y,&c);
        v[x].push_back(make_pair(y,c));
    }
    for(int i=2;i<=n;i++) dp[i]=INF;
    q.push({1,0});
    while(!q.empty())
    {
        int x=q.top().nod;
        int y=q.top().cost;
        q.pop();
        if(y>dp[x]) continue;
        for(vector<pair<int,int> >::iterator it=v[x].begin();it!=v[x].end();it++)
        {
            int sum=y+(*it).second;
            if(sum<dp[(*it).first])
            {
                dp[(*it).first]=sum;
                q.push({(*it).first,dp[(*it).first]});
            }
        }
    }
    for(int i=2;i<=n;i++)
        if(dp[i]==INF) printf("0 ");
            else printf("%d ",dp[i]);
    return 0;
}