#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;

const int maxn = 1e5 + 10;
const int mod = 1e9 + 7;

int n, h[maxn], start[maxn];
bool in_cycle[maxn], vis[maxn];
vector<pair<int, int>> adj[maxn];
set<int> se[maxn];
vector<int> stk, cycle;
bool good;

bool dfs(int v, int p) {
	vis[v] = true;
	stk.push_back(v);
	for (auto [to, id] : adj[v]) {
		if (to == p) {
			continue;
		}

		if (vis[to]) {
			int cur = v;
			while (true) {
				cur = stk.back();
				in_cycle[cur] = true;
				cycle.push_back(cur);
				stk.pop_back();
				if (cur == to) {
					break;
				}
			}
			return true;
		} else {
			if (dfs(to, v)) {
				return true;
			}
		}
	}

	stk.pop_back();
	return false;
}

void try_ins(int v, int value) {
	if (se[v].count(value)) {
		good = false;
	}
	se[v].insert(value);
}

void dfs_tree(int v, int p) {
	vis[v] = true;
	for (auto [to, id] : adj[v]) {
		if (to == p || in_cycle[to]) {
			continue;
		}
		start[id] = to;
		try_ins(to, 1);
		try_ins(v, h[id]);

		if (!vis[to]) {
			dfs_tree(to, v);
		}
	}
}

bool go(int diff) {
	good = true;
	for (int i = 1; i <= n; i++) {
		se[i].clear();
	}
	memset(vis, 0, sizeof vis);

	int C = cycle.size();
	for (int i = 0; i < C; i++) {
		int v = cycle[i];
		vis[v] = true;
		int nxt = cycle[(i + diff + C) % C];
		for (auto [to, id] : adj[v]) {
			if (to == nxt) {
				start[id] = v;
				try_ins(v, 1);
				try_ins(to, h[id]);
			}
		}
	}

	for (int v : cycle) {
		dfs_tree(v, -1);
	}

	return good;
}
int main()
{
	ios_base::sync_with_stdio(false), cin.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		int a, b;
		cin >> a >> b >> h[i];
		adj[a].push_back({b, i});
		adj[b].push_back({a, i});
	}

	dfs(1, -1);
	if (!go(1)) {
		if (!go(-1)) {
			cout << "impossible\n";
			return 0;
		}
	} 

	for (int i = 1; i <= n; i++) {
		cout << start[i] << "\n";
	}
 	return 0;
}