#include <fstream>
#include <vector>
#include <climits>
#include <algorithm>
#include <map>
#define NMAX 50005
#define INF INT_MAX
using namespace std;
int n,m,d[NMAX];
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
map<int,int> coada;
vector< pair <int,int> > G[NMAX];
vector<int> answer;
void citire(){
    f>>n>>m;
    int i,x,y,z;
    for(i=1;i<=m;i++){
        f>>x>>y>>z;
        G[x].push_back(make_pair(y,z));
    }
}
void dijkstra(){
    vector< pair <int,int> >::iterator it;
    d[1]=0;
    int i;
    for(it=G[1].begin();it!=G[1].end();it++){
        d[it->first]=it->second;
        coada.insert(make_pair(it->first,it->second));
    }
    for(i=2;i<=n;i++)
        if(d[i]==0)
            d[i]=INF;
    int ok=0;
    while(!coada.empty()){
        int x=coada.begin()->first;
        for(it=G[x].begin();it!=G[x].end();it++){
            if(d[it->first]>d[x]+it->second){
                if(d[it->first]==INF){
                    coada.insert(make_pair(it->first,d[x]+it->second));
                    d[it->first]=d[x]+it->second;
                }
                else{
                    coada[it->first]=d[x]+it->second;
                    d[it->first]=d[x]+it->second;
                }
            }
        }
        while(!coada.empty()){
            g<<coada.begin()->first<<' '<<coada.begin()->second<<'\n';
            coada.erase(coada.begin());
        }
        break;
        coada.erase(coada.begin());
    }
    for(i=2;i<=n;i++)
        if(d[i]==INF)
            g<<0<<' ';
        else
            g<<d[i]<<' ';
}
int main(){
    citire();
    dijkstra();
    return 0;
}