#include <bits/stdc++.h>
using namespace std;
vector<int> nei[1000000];
bool visited[1000000];
int Size[1000000];
int parent[1000000];
pair<int, int> dist_root[1000000];
long long int dist[1000000];
void DFS(int node) {
  visited[node] = true;
  Size[node] = 1;
  for (auto v : nei[node]) {
    if (!visited[v]) {
      dist_root[v].first = dist_root[node].first + 1;
      parent[v] = node;
      DFS(v);
      Size[node] += Size[v];
    }
  }
}
class DSU {
  int par[1000000];
  int sz[1000000];

 public:
  void init(int N) {
    for (int i = 0; i < N; i++) {
      par[i] = i;
      sz[i] = 1;
    }
  }
  int root(int x) {
    if (par[x] == x) return x;
    par[x] = root(par[x]);
    return par[x];
  }
  void merge(int a, int b) {
    a = root(a);
    b = root(b);
    if (a == b) return;
    if (sz[a] < sz[b]) swap(a, b);
    par[b] = a;
    sz[a] += sz[b];
  }
  int size(int x) { return sz[root(x)]; }
};
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < n - 1; i++) {
    int u, v;
    cin >> u >> v;
    u--;
    v--;
    nei[u].push_back(v);
    nei[v].push_back(u);
  }
  if (n == 1) {
    return 0;
  }
  if (n == 2) {
    cout << "1 2 1" << endl;
    return 0;
  }
  for (int i = 0; i < n; i++) {
    visited[i] = false;
  }
  dist_root[0].first = 0;
  DFS(0);
  parent[0] = -1;
  int centroid = 0;
  int NEXT = -1;
  do {
    NEXT = -1;
    for (auto a : nei[centroid]) {
      if (parent[centroid] != a && Size[a] * 2 > n) {
        NEXT = a;
      }
    }
    if (NEXT != -1) centroid = NEXT;
  } while (NEXT != -1);
  for (int i = 0; i < n; i++) {
    visited[i] = false;
  }
  dist_root[centroid].first = 0;
  DFS(centroid);
  DSU D;
  D.init(n);
  for (int i = 0; i < n; i++) {
    for (auto a : nei[i]) {
      if (i != centroid && a != centroid) {
        D.merge(i, a);
      }
    }
  }
  priority_queue<pair<int, int> > pq;
  for (int i = 0; i < n; i++) visited[i] = false;
  for (int i = 0; i < n; i++) {
    if (i != centroid && !visited[D.root(i)]) {
      visited[D.root(i)] = true;
      pq.push(pair<int, int>(-D.size(i), D.root(i)));
    }
  }
  while (pq.size() > 2) {
    pair<int, int> p1, p2;
    p1 = pq.top();
    pq.pop();
    p2 = pq.top();
    pq.pop();
    p1.first = -p1.first;
    p2.first = -p2.first;
    D.merge(p1.second, p2.second);
    pq.push(pair<int, int>(-D.size(p1.second), D.root(p1.second)));
  }
  int x1 = pq.top().second;
  pq.pop();
  int x2 = pq.top().second;
  pq.pop();
  dist[centroid] = 0;
  long long int sz1 = D.size(x1) + 1;
  for (int i = 0; i < n; i++) dist_root[i].second = i;
  sort(dist_root, dist_root + n);
  long long int cnt1, cnt2;
  cnt1 = 1;
  cnt2 = 1;
  for (int i = 1; i < n; i++) {
    int v = dist_root[i].second;
    if (D.root(v) == x1) {
      dist[v] = cnt1;
      cnt1++;
    } else {
      dist[v] = cnt2 * sz1;
      cnt2++;
    }
  }
  for (int i = 0; i < n; i++) {
    if (i != centroid) {
      cout << i + 1 << " " << parent[i] + 1 << " " << dist[i] - dist[parent[i]]
           << endl;
    }
  }
  return 0;
}
