output_description: Print `First` if Takahashi wins; print `Second` if Aoki wins.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      a_1 b_1
      :
      a_{N-1} b_{N-1}
attempt: import queue
  import sys
  
  n = int(input())
  edges = [[] for i in range(n)]
  for i in range(n - 1):
      a, b = map(lambda s: int(s) - 1, input().split())
      edges[a].append(b)
      edges[b].append(a)
  q = queue.Queue()
  leaf = -1
  for index, ls in enumerate(edges):
      if len(ls) == 1:
          leaf = index
  flag = [False for i in range(n)]
  w = [False for i in range(n)]
  q.put(leaf)
  flag[leaf] = True
  w[leaf] = True
  while not q.empty():
      g = q.get()
      f = not w[g]
      for to in edges[g]:
          if flag[to]:
              continue
          q.put(to)
          flag[to] = True
          w[to] = f
          if not f:
              f = True
      if not f:
          print("First")
          sys.exit()
  
  print("Second" if w.count(True) == w.count(False) else "First")
  
problem_description: Statement
  
  There is a tree with N vertices numbered 1 through N. The i-th of the N-1
  edges connects vertices a_i and b_i.
  
  Initially, each vertex is uncolored.
  
  Takahashi and Aoki is playing a game by painting the vertices. In this game,
  they alternately perform the following operation, starting from Takahashi:
  
    * Select a vertex that is not painted yet.
    * If it is Takahashi who is performing this operation, paint the vertex white; paint it black if it is Aoki.
  
  Then, after all the vertices are colored, the following procedure takes place:
  
    * Repaint every white vertex that is adjacent to a black vertex, in black.
  
  Note that all such white vertices are repainted simultaneously, not one at a
  time.
  
  If there are still one or more white vertices remaining, Takahashi wins; if
  all the vertices are now black, Aoki wins. Determine the winner of the game,
  assuming that both persons play optimally.
samples: [{"input": "3\n    1 2\n    2 3", "output": "First\n    \n\nBelow is a possible progress of the game:\n\n  * First, Takahashi paint vertex 2 white.\n  * Then, Aoki paint vertex 1 black.\n  * Lastly, Takahashi paint vertex 3 white.\n\nIn this case, the colors of vertices 1, 2 and 3 after the final procedure are\nblack, black and white, resulting in Takahashi's victory.\n\n* * *"}, {"input": "4\n    1 2\n    2 3\n    2 4", "output": "First\n    \n\n* * *"}, {"input": "6\n    1 2\n    2 3\n    3 4\n    2 5\n    5 6", "output": "Second"}]