#include <bits/stdc++.h>
#define endln '\n'
#define print(x) cout << (x) << endln
using namespace std;
using ll = long long;

int n;
const int maxN = 1e5 + 5;
vector<pair<int, int>> connections[maxN];
map<int, int> ma[maxN];
set<int> adjacent[maxN];
set<pair<int, int>> directed;

struct Edge
{
    int u, v, w;
};

vector<Edge> input;
vector<int> cycle;
set<int> cycleSet;

bool dfs(int node, int from, set<int> &visited, stack<int> &stk)
{
    visited.insert(node);
    stk.push(node);
    for (pair<int, int> p : connections[node])
    {
        if (visited.count(p.first))
        {
            if (p.first != from)
            {
                while (stk.size() && stk.top() != p.first)
                {
                    cycle.push_back(stk.top());
                    stk.pop();
                }
                if (stk.size())
                    cycle.push_back(stk.top());
                return true;
            }
        }
        else
        {
            visited.insert(p.first);
            if (dfs(p.first, node, visited, stk))
            {
                return true;
            }
        }
    }
    stk.pop();
    return false;
}

void go(int node, int from)
{
    for (pair<int, int> p : connections[node])
    {
        if (cycleSet.count(p.first) == 0 && p.first != from)
        {
            directed.insert({p.first, node});
            go(p.first, node);
        }
    }
}

bool works()
{
    set<int> visited;
    for (int i = 0; i <= n; i++)
    {
        adjacent[i].clear();
    }
    for (int i = 0; i < cycle.size(); i++)
    {
        int cur = cycle[i];
        int nxt = cycle[(i + 1) % (cycle.size())];
        adjacent[nxt].insert(ma[cur][nxt]);
        visited.insert(cur);
    }
    for (int i = 0; i < cycle.size(); i++)
    {
        int node = cycle[i];
        for (pair<int, int> p : connections[node])
        {
            if (visited.count(p.first) == 0)
            {
                if (adjacent[node].count(p.second))
                {
                    return false;
                }
                adjacent[node].insert(p.second);
            }
        }
    }
    return true;
}

void solve()
{
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        int u, v, h;
        cin >> u >> v >> h;
        ma[u][v] = h;
        ma[v][u] = h;
        connections[u].push_back({v, h});
        connections[v].push_back({u, h});
        input.push_back({u, v, h});
    }
    set<int> visited;
    stack<int> stk;
    dfs(1, 0, visited, stk);
    for (int i : cycle)
    {
        cycleSet.insert(i);
    }

    for (int i : cycle)
    {
        go(i, -1);
    }

    if (works())
    {
        for (int i = 0; i < cycle.size(); i++)
        {
            int cur = cycle[i];
            int nxt = cycle[(i + 1) % (cycle.size())];
            directed.insert({cur, nxt});
        }
        for (Edge e : input)
        {
            if (directed.count({e.u, e.v}))
            {
                print(e.u);
            }
            else
            {
                print(e.v);
            }
        }
        return;
    }

    reverse(cycle.begin(), cycle.end());
    if (works())
    {
        for (int i = 0; i < cycle.size(); i++)
        {
            int cur = cycle[i];
            int nxt = cycle[(i + 1) % (cycle.size())];
            directed.insert({cur, nxt});
        }
        for (Edge e : input)
        {
            if (directed.count({e.u, e.v}))
            {
                print(e.u);
            }
            else
            {
                print(e.v);
            }
        }
        return;
    }
    print("impossible");
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    solve();
}