output_description: If it is possible to have only one integer on the blackboard, print `YES`.
  Otherwise, print `NO`.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      N
      A_1 A_2 … A_N
attempt: n = int(input().strip())
  a = [int(x) for x in input().strip().split()]
  flg = [-1 for i in range(n)]
  b = []
  l = [[] for i in range(n)]
  for i in range(n - 1):
      b.append([int(x) - 1 for x in input().strip().split()])
  for x in b:
      l[x[0]].append(x[1])
      l[x[1]].append(x[0])
  
  while True:
      minimum = a[0]
      idx = []
      for i, x in enumerate(a):
          if flg[i] != -1 or x > minimum:
              continue
          if x < minimum:
              minimum = x
              idx = [i]
          else:
              idx.append(i)
      while True:
          w = []
          for i in idx:
              flg[i] = 0
              for x in l[i]:
                  if flg[x] == -1 and a[x] != a[i]:
                      flg[x] = 1
                      w.append(x)
          idx = []
          for i in w:
              for x in l[i]:
                  if flg[x] == -1:
                      flg[x] = 0
                      for y in l[x]:
                          if flg[y] == -1 and a[x] > a[y]:
                              flg[x] = -1
                              break
                      if flg[x] == 0:
                          idx.append(x)
          if len(idx) == 0:
              break
      if -1 not in flg:
          break
  
  sep = ""
  s = ""
  for i, x in enumerate(flg):
      if x == 1:
          s += sep + str(i + 1)
          sep = " "
  
  print(s)
  
problem_description: Statement
  
  There are N integers written on a blackboard. The i-th integer is A_i.
  
  Takahashi will repeatedly perform the following operation on these numbers:
  
    * Select a pair of integers, A_i and A_j, that have the same parity (that is, both are even or both are odd) and erase them.
    * Then, write a new integer on the blackboard that is equal to the sum of those integers, A_i+A_j.
  
  Determine whether it is possible to have only one integer on the blackboard.
samples: [{"input": "3\n    1 2 3", "output": "YES\n    \n\nIt is possible to have only one integer on the blackboard, as follows:\n\n  * Erase 1 and 3 from the blackboard, then write 4. Now, there are two integers on the blackboard: 2 and 4.\n  * Erase 2 and 4 from the blackboard, then write 6. Now, there is only one integer on the blackboard: 6.\n\n* * *"}, {"input": "5\n    1 2 3 4 5", "output": "NO"}]