output_description: If a is not less than 3200, print s; if a is less than 3200, print `red`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      a
      s
attempt: N, Q = map(int, input().split())
  tree = [list(map(int, input().split())) for i in range(N - 1)]
  process = [list(map(int, input().split())) for i in range(Q)]
  
  
  def next_node(node_num):
      next_nodes = []
      for edge in tree:
          if edge[0] == node_num:
              next_nodes.append(edge[1])
      return next_nodes
  
  
  def all_nodes(num):
      x = []
      add_nodes = next_node(num)
      while add_nodes != []:
          for i in add_nodes:
              add_nodes += next_node(i)
              x += add_nodes
              add_nodes = []
      return x
  
  
  def add(score, procedure):
      "procedure = [p, x]"
      score[procedure[0] - 1] += procedure[1]
      for n in all_nodes(procedure[0]):
          score[n - 1] += procedure[1]
      return score
  
  
  score = [0] * N
  for procedure in process:
      add(score, procedure)
  print(score)
  
problem_description: Statement
  
  You will be given an integer a and a string s consisting of lowercase English
  letters as input.
  
  Write a program that prints s if a is not less than 3200 and prints `red` if a
  is less than 3200.
samples: [{"input": "3200\n    pink", "output": "pink\n    \n\na = 3200 is not less than 3200, so we print s = `pink`.\n\n* * *"}, {"input": "3199\n    pink", "output": "red\n    \n\na = 3199 is less than 3200, so we print `red`.\n\n* * *"}, {"input": "4049\n    red", "output": "red\n    \n\na = 4049 is not less than 3200, so we print s = `red`."}]