#include <cstdio>
#include <vector>
#include <queue>
#define nmax 50010
#define inf 1<<30

using namespace std;



struct vecin
{
    int vc,c;
};

vector<vecin> v[nmax];
int prez[nmax],n,m,cost[nmax];

struct cmp
{
    bool operator()(const int& a, const int& b)
    {
        return cost[a]>cost[b];
    }
};

void citire()
{
    int i,j,x;
    vecin vec;
    scanf("%d%d",&n,&m);
    for(i=1;i<=m;i++)
        {
            scanf("%d%d%d",&x,&vec.vc,&vec.c);
            v[x].push_back(vec);
        }
    for(i=2;i<=n;i++)
        cost[i]=inf;
}

void dijkstra()
{
    priority_queue<int, vector<int>, cmp>q;
    int p,i;
    vecin vec;
    q.push(1);
    while(!q.empty())
          {
              p=q.top();
              q.pop();
              for(i=0;i<v[p].size();i++)
                  {
                      vec=v[p][i];
                      if(vec.c+cost[p]<cost[vec.vc])
                         {
                             cost[vec.vc]=vec.c+cost[p];
                             if(!prez[vec.vc])
                                {
                                    q.push(vec.vc);
                                    prez[vec.vc]=1;
                                }
                         }
                  }
              prez[p]=0;
          }
}

void afisare()
{
    int i;
    for(i=2;i<=n;i++)
        printf("%d ",cost[i]);
}

int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);

    citire();
    dijkstra();
    afisare();


    return 0;
}