#include <bits/stdc++.h>
using namespace std;

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FILL(a, b) memset(a, b, sizeof(a))

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

const int MAX = 1 << 17;

int from[MAX], to[MAX], h[MAX];
vector<pair<int, int>> g[MAX];
int par[MAX];
int used[MAX];
int low, high, extraEdge;
bool onCycle[MAX];
bool ok = true;
set<int> hs[MAX];

void dfs1(int v) {
	used[v] = 1;
	for (auto [u, i] : g[v]) {
		if (par[v] != i) {
			if (used[u] == 0) {
				par[u] = i;
				dfs1(u);
			}
			else if (used[u] == 1) {
				low = v;
				high = u;
				extraEdge = i;
			}
		}
	}
	used[v] = 2;
}

void dfs2(int v, int p) {
	for (auto [u, i] : g[v]) {
		if (onCycle[u] || u == p) {
			continue;
		}
		if (from[i] == v) {
			swap(from[i], to[i]);
		}
		assert(from[i] == u && to[i] == v);
		dfs2(u, v);
		ok &= !hs[v].count(h[i]);
		hs[v].insert(h[i]);
	}
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n;
	cin >> n;
	FOR(i, 0, n) {
		cin >> from[i] >> to[i] >> h[i];
		from[i]--;
		to[i]--;
		g[from[i]].emplace_back(to[i], i);
		g[to[i]].emplace_back(from[i], i);
	}
	par[0] = -1;
	dfs1(0);
	vector<int> cycleVertices, cycleEdges;
	for (int v = low; v != high; ) {
		cycleVertices.push_back(v);
		onCycle[v] = true;
		int e = par[v];
		cycleEdges.push_back(e);
		v = from[e] == v ? to[e] : from[e];
	}
	cycleVertices.push_back(high);
	onCycle[high] = true;
	cycleEdges.push_back(extraEdge);
	for (int v : cycleVertices) {
		dfs2(v, -1);
	}
	int len = SZ(cycleVertices);
	FOR(it, 0, 2) {
		bool curOk = ok;
		FOR(i, 0, len) {
			int e = cycleEdges[i];
			int curV = cycleVertices[i], nextV = cycleVertices[(i + 1) % len];
			if (from[e] != curV) {
				swap(from[e], to[e]);
			}
			assert(from[e] == curV && to[e] == nextV);
			curOk &= !hs[nextV].count(h[e]);
		}
		if (curOk) {
			FOR(i, 0, n) {
				cout << from[i] + 1 << "\n";
			}
			return 0;
		}
		reverse(ALL(cycleVertices));
		vector<int> newCycleEdges;
		RFOR(i, len - 1, 0) {
			newCycleEdges.push_back(cycleEdges[i]);
		}
		newCycleEdges.push_back(extraEdge);
		cycleEdges = newCycleEdges;
	}
	cout << "impossible\n";
	return 0;
}