#include<iostream>
#include<queue>
#include<memory.h>
using namespace std;
typedef long long ll;
const int Max = 1e6 + 5;
struct node
{
int n, v;
node(int a, int b)
{
n = a, v = b;
}
bool operator <( const node& a) const
{
return v>a.v;
}
};
int u[Max], v[Max], nex[Max];
int first[Max], w[Max], g = 0;
priority_queue<node> que;
vector<int> vec[Max];
int dis[Max];
int b[Max];
void add(int a, int b, int c)
{
u[++g] = a;
v[g] = b;
w[g] = c;
nex[g] = first[a];
first[a] = g;
}
int main()
{
memset(first, -1, sizeof(first));
memset(dis, 127, sizeof(dis));
que.push(node(1, 0));
int n, m;cin >> n >> m;
for (int i = 1;i <= m;i++)
{
int a, b, c;cin >> a >> b >> c;
add(a, b, c);
add(b, a, c);
}
while (!que.empty())
{
int no = que.top().n;
if (b[no]) {
que.pop(); continue; }
dis[no] = que.top().v;
b[no] = 1;
que.pop();
for (int i = first[no];i!=-1;i=nex[i])
{
int p = v[i];
if (b[p])continue;
if (dis[no] + w[i] < dis[p])
{
dis[p]=dis[no]+w[i];
que.push(node(p, dis[p]);
}
}
}
for (int i = 1;i <= n;i++)cout << dis[i] << " ";
}