#include <bits/stdc++.h>
using namespace std;
int sub[1000];
int n;
vector<int> adj[1000];
int par[1000];
bool isleft[1000];
int getsub(int now, int from) {
  int ret = 1;
  for (int i = 0; i < adj[now].size(); i++) {
    int to = adj[now][i];
    if (to != from) {
      ret += getsub(to, now);
    }
  }
  sub[now] = ret;
  return ret;
}
int getcent(int now, int from) {
  for (int i = 0; i < adj[now].size(); i++) {
    int to = adj[now][i];
    if (to != from && sub[to] > n / 2) {
      return getcent(to, now);
    }
  }
  return now;
}
int distinct(int now, int from, bool val) {
  int ret = 0;
  for (int i = 0; i < adj[now].size(); i++) {
    int to = adj[now][i];
    if (to == from) {
      continue;
    }
    if ((from == -1 && isleft[to] == val) || from != -1) {
      int cur = distinct(to, now, val);
      par[to] = (ret + 1);
      ret += cur + 1;
    }
  }
  return ret;
}
void mult(int now, int from, bool val, int m) {
  for (int i = 0; i < adj[now].size(); i++) {
    int to = adj[now][i];
    if (to == from) {
      continue;
    }
    if ((from == -1 && isleft[to] == val) || from != -1) {
      mult(to, now, val, m);
      par[to] *= m;
    }
  }
}
void pr(int now, int from) {
  for (int i = 0; i < adj[now].size(); i++) {
    int to = adj[now][i];
    if (to == from) {
      continue;
    }
    cout << (now + 1) << " " << (to + 1) << " " << par[to] << endl;
    pr(to, now);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 0; i < n; i++) {
    par[i] = 0;
  }
  for (int i = 1; i < n; i++) {
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    adj[a].push_back(b);
    adj[b].push_back(a);
  }
  getsub(0, -1);
  int cent = getcent(0, -1);
  getsub(cent, -1);
  for (int i = 0; i < n; i++) {
    isleft[i] = true;
  }
  int left = n - 1;
  int right = 0;
  for (int k = 0; k < 2; k++) {
    for (int i = 0; i < adj[cent].size(); i++) {
      int to = adj[cent][i];
      if (isleft[to] &&
          abs(left - sub[to] - right - sub[to]) < abs(left - right)) {
        isleft[to] = false;
        left -= sub[to];
        right += sub[to];
      }
      if (!isleft[to] &&
          abs(left + sub[to] - right + sub[to]) < abs(left - right)) {
        isleft[to] = true;
        left += sub[to];
        right -= sub[to];
      }
    }
  }
  if (left < right) {
    for (int i = 0; i < adj[cent].size(); i++) {
      int to = adj[cent][i];
      isleft[to] = !isleft[to];
    }
    swap(left, right);
  }
  distinct(cent, -1, true);
  distinct(cent, -1, false);
  mult(cent, -1, false, (left + 1));
  pr(cent, -1);
}
