#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
const int M = 1;
const int K = 1;
const int mod = 1e9 + 7;
const int inf = 2e9;
const long long Inf = 2e18;
int n, root, cur, hum;
vector<int> adj[N], child[N];
int siz[N];
bool vis[N];
void dfs(int u) {
  vis[u] = true;
  siz[u] = 1;
  for (int v : adj[u])
    if (!vis[v]) {
      dfs(v);
      child[u].push_back(v);
      siz[u] += siz[v];
    }
}
bool cmp(int x, int y) { return siz[x] < siz[y]; }
bool ok[N];
void res(int u, int x) {
  for (int v : child[u]) {
    if (u == root && !ok[v]) continue;
    cur++;
    cout << u << ' ' << v << ' ' << cur - x << '\n';
    res(v, cur);
  }
}
void ans(int u, int x) {
  for (int v : child[u]) {
    if (u == root && ok[v]) continue;
    cur += hum;
    cout << u << ' ' << v << ' ' << cur - x << '\n';
    ans(v, cur);
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 1; i < n; ++i) {
    int u, v;
    cin >> u >> v;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  for (int i = 1; i <= n; ++i) {
    memset(vis, 0, sizeof vis);
    for (int j = 1; j <= n; ++j) child[j].clear();
    dfs(i), root = i;
    bool ok = 0;
    for (int u : child[i])
      if (siz[u] > n / 2) ok = 1;
    if (!ok) break;
  }
  sort(child[root].begin(), child[root].end(), cmp);
  cur = 0;
  for (int i = 0; i < (int)child[root].size(); ++i) {
    int u = child[root][i];
    ok[u] = 1;
    cur += siz[u];
    if (cur >= (n - 1) / 3) break;
  }
  cur = 0;
  res(root, 0);
  hum = cur + 1, cur = 0;
  ans(root, 0);
}
