#include <bits/stdc++.h>
using namespace std;
int n, m, child[100005];
vector<int> graph[100005], ans;
bool vis[100005];
char a[100005];
void dfs(int u, int p) {
  child[u] = 1;
  for (int i = 0; i < graph[u].size(); i++) {
    int v = graph[u][i];
    if (v != p && vis[v] == 0) {
      dfs(v, u);
      child[u] += child[v];
    }
  }
}
int cen(int u, int p, int sz) {
  int check1 = 0;
  for (int i = 0; i < graph[u].size(); i++) {
    int v = graph[u][i];
    if (vis[v] == 0 && v != p) {
      if (child[v] * 2 > sz) return cen(v, u, sz);
    }
  }
  return u;
}
void centroid(int u, int num) {
  dfs(u, u);
  int mid = cen(u, u, child[u]);
  a[mid] = (char)(num + 65);
  vis[mid] = 1;
  ans.push_back(mid);
  for (int i = 0; i < graph[mid].size(); i++) {
    int v = graph[mid][i];
    if (vis[v] == 0) {
      centroid(v, num + 1);
    }
  }
}
int main() {
  cin.tie(0), cout.tie(0), ios::sync_with_stdio(0);
  cin >> n;
  int u, v;
  for (int i = 1; i <= n - 1; i++) {
    cin >> u >> v;
    graph[u].push_back(v);
    graph[v].push_back(u);
  }
  centroid(1, 0);
  for (int i = 1; i <= n; i++) cout << a[i] << " ";
}
