#include <iostream>
#include <fstream>
#include <bitset>
#include <vector>
#include <queue>
#define MAX 50001
#define VMAX 50000000
#define x first
#define y second

using namespace std;

int n,m,a,b,c,cmin[MAX];
vector<pair<int,int>> nd[MAX];
queue<int> q;
bitset<MAX> inq;

int main()
{
    ifstream f ("bellmanford.in");
    ofstream g ("bellmanford.out");
    f>>n>>m;
    for(int i=1;i<=m;i++){
      f>>a>>b>>c;
      nd[a].push_back(make_pair(b,c));
    }
    for(int i=1;i<=n;i++)cmin[i]=VMAX;
    q.push(1);cmin[1]=0;
    while(not q.empty()){
      int ac=q.front();q.pop();
      inq[ac]=false;
      for(auto i:nd[ac]){
        if(cmin[ac]+i.y<cmin[i.x]){
          cmin[i.x]=cmin[ac]+i.y;
          if(not inq[i.x])q.push(i.x),inq[i.x]=true;
        }
      }
    }
    for(int i=2;i<=n;i++)g<<cmin[i]<<" ";
    f.close ();
    g.close ();
    return 0;
}