#include <bits/stdc++.h>
using namespace std;
template <class T>
bool uin(T &a, T b) {
  return a > b ? (a = b, true) : false;
}
template <class T>
bool uax(T &a, T b) {
  return a < b ? (a = b, true) : false;
}
int n;
const int maxn = 1100;
vector<int> e[maxn];
int w[maxn];
int sum[maxn];
map<pair<int, int>, int> col;
void color(int v, int p, int &nxt, int mul) {
  sum[v] = nxt++ * mul;
  col[{v, p}] = sum[v] - sum[p];
  for (int u : e[v])
    if (u != p) color(u, v, nxt, mul);
}
int lb, rb;
bool done = false;
void dfs(int v, int p) {
  w[v] = 1;
  int pi = -1;
  for (int i = 0; i < (int)(e[v].size()); ++i) {
    if (w[v] >= lb) {
      assert(w[v] <= rb);
      pi = i;
      break;
    }
    int u = e[v][i];
    if (u == p) continue;
    dfs(u, v);
    if (done) return;
    w[v] += w[u];
  }
  if (done) return;
  if (pi == -1 && w[v] >= lb) {
    assert(w[v] <= rb);
    pi = e[v].size();
  }
  if (pi != -1) {
    cerr << v << ' ' << pi << ' ' << w[v] << "!\n";
    int nxt1 = 1, nxt2 = 1;
    for (int i = 0; i < (int)(e[v].size()); ++i) {
      int u = e[v][i];
      if (i < pi && u != p)
        color(u, v, nxt1, 1);
      else
        color(u, v, nxt2, w[v]);
    }
    done = true;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.precision(10);
  cout << fixed;
  cin >> n;
  if (n == 1) return 0;
  for (int i = 0; i < (int)(n - 1); ++i) {
    int x, y;
    cin >> x >> y;
    --x;
    --y;
    e[x].push_back(y);
    e[y].push_back(x);
  }
  lb = (n + 2) / 3;
  rb = (2 * n) / 3;
  dfs(0, -1);
  assert(done);
  for (auto w : col) {
    cout << w.first.first + 1 << ' ' << w.first.second + 1 << ' ' << w.second
         << '\n';
  }
  return 0;
}
