#include <bits/stdc++.h>
using namespace std;
const long long M = 1e9 + 7, maxn = 1e5 + 50;
long long int ans[maxn], q, k, n, m, x, y, sz[maxn], h[maxn];
std::vector<long long int> adj[maxn];
bool mark[maxn];
void DfsData(long long int v, long long int par = -1) {
  sz[v] = 1;
  for (long long int u : adj[v]) {
    if (!mark[u] && u != par) {
      h[u] = h[v] + 1;
      DfsData(u, v);
      sz[v] += sz[u];
    }
  }
}
long long int FindCentroid(long long int v, long long int siz,
                           long long int par = -1) {
  for (long long int u : adj[v]) {
    if (sz[u] * 2 > siz && !mark[u] && u != par) return FindCentroid(u, siz, v);
  }
  return v;
}
void Centroid(long long int v, long long int H) {
  h[v] = 0;
  DfsData(v);
  v = FindCentroid(v, sz[v]);
  h[v] = 0;
  DfsData(v);
  mark[v] = true;
  ans[v] = H + 'A';
  for (long long int u : adj[v])
    if (!mark[u]) Centroid(u, H + 1);
}
int32_t main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n;
  for (long long int i = 0; i < n - 1; i++) {
    cin >> x >> y;
    adj[x].push_back(y);
    adj[y].push_back(x);
  }
  Centroid(1, 0);
  for (long long int i = 1; i <= n; i++) cout << char(ans[i]) << " ";
  return 0;
}
