output_description: Print N lines. The k-th line, print the length of the longest increasing
  subsequence of the sequence obtained from the shortest path from Vertex 1 to
  Vertex k.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      a_1 a_2 ... a_N
      u_1 v_1
      u_2 v_2
      :
      u_{N-1} v_{N-1}
attempt: import sys
  
  
  def input():
      return sys.stdin.readline().strip()
  
  
  n, a, b, c = map(int, input().split())
  s = []
  for _ in range(n):
      s.append(input())
  
  # 0 <= i < n-1
  ans = []
  for i in range(n - 1):
      if s[i] == "BC":
          if b > c:
              ans.append("C")
              b -= 1
              c += 1
          elif b < c:
              ans.append("B")
              b += 1
              c -= 1
          elif s[i + 1] == "AB":
              ans.append("B")
              b += 1
              c -= 1
          else:
              ans.append("C")
              b -= 1
              c += 1
  
      elif s[i] == "AC":
          if a > c:
              ans.append("C")
              a -= 1
              c += 1
          elif a < c:
              ans.append("A")
              a += 1
              c -= 1
          elif s[i + 1] == "BC":
              ans.append("C")
              a -= 1
              c += 1
          else:
              ans.append("A")
              a += 1
              c -= 1
  
      else:
          if a > b:
              ans.append("B")
              a -= 1
              b += 1
          elif a < b:
              ans.append("A")
              a += 1
              b -= 1
          elif s[i + 1] == "AC":
              ans.append("A")
              a += 1
              b -= 1
          else:
              ans.append("B")
              a -= 1
              b += 1
  
      if a < 0 or b < 0 or c < 0:
          print("No")
          exit()
  
  # i = n-1
  if s[n - 1] == "BC":
      if b > c:
          ans.append("C")
          b -= 1
          c += 1
      else:
          ans.append("B")
          b += 1
          c -= 1
  
  elif s[n - 1] == "AC":
      if a > c:
          ans.append("C")
          a -= 1
          c += 1
      else:
          ans.append("A")
          a += 1
          c -= 1
  
  else:
      if a > b:
          ans.append("B")
          a -= 1
          b += 1
      else:
          ans.append("A")
          a += 1
          b -= 1
  
  if a < 0 or b < 0 or c < 0:
      print("No")
      exit()
  
  print("Yes")
  for i in ans:
      print(i)
  
problem_description: Statement
  
  We have a tree with N vertices, whose i-th edge connects Vertex u_i and Vertex
  v_i. Vertex i has an integer a_i written on it. For every integer k from 1
  through N, solve the following problem:
  
    * We will make a sequence by lining up the integers written on the vertices along the shortest path from Vertex 1 to Vertex k, in the order they appear. Find the length of the longest increasing subsequence of this sequence.
  
  Here, the longest increasing subsequence of a sequence A of length L is the
  subsequence A_{i_1} , A_{i_2} , ... , A_{i_M} with the greatest possible value
  of M such that 1 \leq i_1 < i_2 < ... < i_M \leq L and A_{i_1} < A_{i_2} < ...
  < A_{i_M}.
samples: [{"input": "10\n    1 2 5 3 4 6 7 3 2 4\n    1 2\n    2 3\n    3 4\n    4 5\n    3 6\n    6 7\n    1 8\n    8 9\n    9 10", "output": "1\n    2\n    3\n    3\n    4\n    4\n    5\n    2\n    2\n    3\n    \n\nFor example, the sequence A obtained from the shortest path from Vertex 1 to\nVertex 5 is 1,2,5,3,4. Its longest increasing subsequence is A_1, A_2, A_4,\nA_5, with the length of 4."}]