#include <bits/stdc++.h>
using namespace std;
const int N = 100000;
unordered_set<int> edges[N];
int size[N];
int centroidParent[N];
int centroidLevel[N];
void dfsSize(int u, int p) {
  size[u] = 1;
  for (int v : edges[u])
    if (v != p) {
      dfsSize(v, u);
      size[u] += size[v];
    }
}
int centroid(int u, int p, int half) {
  for (auto it = edges[u].begin(); it != edges[u].end(); it++)
    if (*it != p && size[*it] > half) return centroid(*it, u, half);
  return u;
}
void decompose(int u, int p, int level) {
  dfsSize(u, u);
  int c = centroid(u, p, size[u] / 2);
  if (p == -1) p = c;
  centroidParent[c] = p;
  centroidLevel[c] = level;
  for (auto it = edges[c].begin(); it != edges[c].end(); it++) {
    edges[*it].erase(c);
    decompose(*it, u, level + 1);
  }
  edges[c].clear();
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    int u, v;
    scanf("%d %d", &u, &v);
    edges[u - 1].insert(v - 1);
    edges[v - 1].insert(u - 1);
  }
  decompose(0, -1, 0);
  for (int i = 0; i < n; i++) {
    cout << (char)(centroidLevel[i] + 65) << " ";
  }
  cout << "\n";
}
