#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
/*
Phu Trong from Nguyen Tat Thanh High School for gifted student
*/
template <class X, class Y>
bool minimize(X &x, const Y &y){
X eps = 1e-9;
if (x > y + eps) {x = y; return 1;}
return 0;
}
template <class X, class Y>
bool maximize(X &x, const Y &y){
X eps = 1e-9;
if (x + eps < y) {x = y; return 1;}
return 0;
}
int N, M;
#define MAX 100005
vector<tuple<int, int, int>> Q;
int A[MAX];
#define cs 1'000'000'000
int a[MAX], b[MAX], c[MAX];
void process(void){
cin >> N >> M;
FOR(i, 1, N) A[i] = cs;
for (int i = 1; i <= M; ++i){
int a, b, c; cin >> a >> b >> c;
Q.emplace_back(c, a, b);
}
sort(Q.begin(), Q.end());
for (tuple<int, int, int>&x : Q){
int a, b, c; tie(c, a, b) = x;
A[a] = A[b] = c;
}
for (int i = 1; i <= N; ++i) cout << A[i] << " ";
}
signed main(){
#define name "Whisper"
cin.tie(nullptr) -> sync_with_stdio(false);
//freopen(name".inp", "r", stdin);
//freopen(name".out", "w", stdout);
process();
return (0 ^ 0);
}
