#include <bits/stdc++.h>
using std::bitset;
using std::cerr;
using std::cin;
using std::cout;
using std::deque;
using std::endl;
using std::fixed;
using std::ios_base;
using std::make_pair;
using std::make_tuple;
using std::map;
using std::nth_element;
using std::pair;
using std::queue;
using std::reverse;
using std::set;
using std::sort;
using std::stack;
using std::string;
using std::tuple;
using std::unordered_map;
using std::unordered_set;
using std::vector;
template <typename T>
void debug(T x, char end = '\n') {}
template <typename T, typename... Args>
void debug(T x, Args... args) {}
const int MAXN = 100000;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const int64_t L_INF = 4e18;
int n;
vector<int> g[MAXN];
int w[MAXN], par[MAXN], c[MAXN];
int get_center(int v, int p, int& center) {
  w[v] = 1;
  for (int u : g[v]) {
    if (u == p) continue;
    w[v] += get_center(u, v, center);
  }
  if (2 * w[v] >= n && center == -1) center = v;
  return w[v];
}
void dfs(int v, int p, int& cc, int step) {
  cc += step;
  c[v] = cc;
  par[v] = p;
  for (int u : g[v]) {
    if (u == p) continue;
    dfs(u, v, cc, step);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.precision(10);
  cout << fixed;
  cin >> n;
  for (int i = 0; i < n - 1; ++i) {
    int v, u;
    cin >> v >> u;
    --v, --u;
    g[v].push_back(u);
    g[u].push_back(v);
  }
  int center = -1;
  get_center(0, -1, center);
  debug("center", center);
  for (int u : g[center]) {
    if (w[u] > w[center]) {
      w[u] = n - w[center];
      break;
    }
  }
  sort(g[center].begin(), g[center].end(),
       [](int i, int j) { return w[i] < w[j]; });
  int sep = 0, sum = 0;
  while (sep < (int)g[center].size()) {
    int v = g[center][sep++];
    sum += w[v];
    if (sum > (n - 1) / 3) break;
  }
  debug("sep", sep, "\nsum", sum);
  assert(n <= 2 || sum <= 2 * (n - 1) / 3);
  par[center] = -1;
  for (int i = 0, cc = 0; i < sep; ++i) {
    int v = g[center][i];
    dfs(v, center, cc, 1);
  }
  for (int i = sep, cc = 0; i < (int)g[center].size(); ++i) {
    int v = g[center][i];
    dfs(v, center, cc, sum + 1);
  }
  for (int v = 0; v < n; ++v) {
    if (par[v] != -1) {
      cout << v + 1 << ' ' << par[v] + 1 << ' ' << c[v] - c[par[v]] << '\n';
    }
  }
  return 0;
}
