#include <bits/stdc++.h>
using namespace std;
const int inf = 2147483647;
const int N = 1001;
int _max(int x, int y) { return x > y ? x : y; }
int _min(int x, int y) { return x < y ? x : y; }
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9')
    x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
  return x * f;
}
void put(int x) {
  if (x < 0) putchar('-'), x = -x;
  if (x >= 10) put(x / 10);
  putchar(x % 10 + '0');
}
int tp, sta[N];
struct edge {
  int x, y, c, next;
} e[2 * N];
int len, last[N];
int n, tot[N], fa[N];
int id, now;
int pt, mn;
void ins(int x, int y) {
  e[++len].x = x, e[len].y = y;
  e[len].next = last[x], last[x] = len;
}
void dfs(int x) {
  tot[x] = 1;
  int hh = 0;
  for (int k = last[x]; k; k = e[k].next) {
    int y = e[k].y;
    if (y != fa[x]) {
      fa[y] = x, dfs(y);
      tot[x] += tot[y];
      hh = _max(hh, tot[y]);
    }
  }
  hh = _max(hh, n - tot[x]);
  if (hh < mn) mn = hh, pt = x;
}
void gt(int x, int fa, int dis) {
  for (int k = last[x]; k; k = e[k].next) {
    int y = e[k].y;
    if (y != fa) {
      ++id;
      int c = id * now - dis;
      e[k].c = e[k ^ 1].c = c;
      gt(y, x, dis + c);
    }
  }
}
bool cmp(int a, int b) { return tot[e[a].y] < tot[e[b].y]; }
int main() {
  n = read();
  if (n == 1) {
    return 0;
  }
  len = 1;
  for (int i = 1; i < n; i++) {
    int x = read(), y = read();
    ins(x, y), ins(y, x);
  }
  mn = n + 1, dfs(1);
  int cc = pt;
  fa[pt] = 0, dfs(pt), pt = cc;
  int sum = 0, u = 0, gg;
  for (int k = last[pt]; k; k = e[k].next) sta[++tp] = k;
  sort(sta + 1, sta + tp + 1, cmp);
  for (int i = 1; i <= tp; i++) {
    int k = sta[i];
    int y = e[k].y;
    sum += tot[y];
    if ((sum + 1) * (n - sum) >= u) u = (sum + 1) * (n - sum), gg = i;
  }
  int o = 0;
  id = 0, now = 1;
  for (int i = 1; i <= gg; i++) {
    int k = sta[i];
    int y = e[k].y;
    ++id;
    e[k].c = e[k ^ 1].c = id;
    gt(y, pt, id);
    o += tot[y];
  }
  id = 0, now = o + 1;
  for (int i = gg + 1; i <= tp; i++) {
    int k = sta[i];
    int y = e[k].y;
    ++id;
    e[k].c = e[k ^ 1].c = id * now;
    gt(y, pt, id * now);
  }
  for (int i = 2; i < len; i += 2) printf("%d %d %d\n", e[i].x, e[i].y, e[i].c);
}
