#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y, long long md = 1000000007) {
  long long res = 1;
  x %= md;
  while (y > 0) {
    if (y & 1) res = (res * x) % md;
    x = (x * x) % md;
    y = y >> 1;
  }
  return res % md;
}
struct node {
  vector<long long> v, w;
  long long sz;
} nodes[500004];
vector<pair<long long, long long> > ans(500005);
long long dfs(long long index, long long parent) {
  long long sz = 1;
  long long len = nodes[index].v.size();
  for (long long i = 0; i < len; i++) {
    if (nodes[index].v[i] != parent) {
      sz += dfs(nodes[index].v[i], index);
    }
  }
  return nodes[index].sz = sz;
}
void dfs1(long long index, long long parent, long long st, long long used) {
  long long sz = 0;
  long long cnt = 0;
  long long len = nodes[index].v.size();
  for (long long i = 0; i < len; i++) {
    if (nodes[index].v[i] != parent) {
      cnt++;
      sz += 2 * nodes[nodes[index].v[i]].sz - 1;
    }
  }
  ans[index] = {st, st + used + cnt + 1};
  long long us = 0;
  long long st1 = st + used + cnt + 1;
  for (long long i = 0; i < len; i++) {
    if (nodes[index].v[i] != parent) {
      st1--;
      dfs1(nodes[index].v[i], index, st1, us + (st + used + cnt + 1 - st1));
      us += 2 * nodes[nodes[index].v[i]].sz - 1;
    }
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long n;
  cin >> n;
  for (long long i = 0; i < n - 1; i++) {
    long long u, v;
    cin >> u >> v;
    u--;
    v--;
    nodes[u].v.push_back(v);
    nodes[v].v.push_back(u);
  }
  dfs(0, -1);
  dfs1(0, -1, 1, 0);
  for (long long i = 0; i < n; i++)
    cout << ans[i].first << " " << ans[i].second << '\n';
}
