#include<cstdio>
#include<vector>
#include<deque>
#include<bitset>
#define dest first
#define cost second
using namespace std;
const int NMAX = 50005;
const int INF = 1<<30;
int n,m,i,x,y,c,C[NMAX],cnt[NMAX];
vector<pair<int,int> > a[NMAX];
deque<int> Q;
bitset<NMAX> B;
int main()
{
    freopen("bellmanford.in","r",stdin);
    freopen("bellmanford.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1;i<=m;i++)
    {
        scanf("%d%d%d",&x,&y,&c);
        a[x].push_back(make_pair(y,c));
    }
    Q.push_back(1);
    for(i=2;i<=n;i++) C[i]=INF; B[1]=1;
    while(!Q.empty())
    {
        x=Q.front();
        for(i=0;i<a[x].size();i++)
        {
            y=a[x][i].dest; c=a[x][i].cost;
            if(C[x]+c<C[y])
            {
                C[y]=C[x]+c;
                if(!B[y]) {Q.push_back(y); B[y]=1;}
            }
        }
        Q.pop_front(); B[x]=0; cnt[x]++;
        //if(cnt[x]==n) {printf("Ciclu negativ!\n");return 0;}
    }
    for(i=2;i<=n;i++) printf("%d ",C[i]);
    return 0;
}