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: """
  Writer: SPD_9X2
  https://atcoder.jp/contests/agc014/tasks/agc014_d
  
  白にしか隣接しない白を作れれば勝ちである
  黒は、直前に置かれた白に対して対策するような動きをする羽目になる
  
  距離2の葉の対があったら100%可能
  
  ある時点での残りの森を考える(残りのどの点も黒が隣接していないとする)
  葉に白を置く→葉において阻止
  葉に隣接する点にしろを置く→葉において阻止
  それ以外の点は、置いたら横に置くだけ(葉ではないので、隣接頂点が存在する)
  
  なので、十分性もおｋ？
  距離2の葉が存在するかだけを判定すればよさそう
  
  """
  
  N = int(input())
  
  lis = [[] for i in range(N)]
  
  for i in range(N - 1):
  
      a, b = map(int, input().split())
  
      a -= 1
      b -= 1
      lis[a].append(b)
      lis[b].append(a)
  
  import sys
  
  sys.setrecursionlimit(500000)
  
  if N == 2:
      print("Second")
      sys.exit
  
  
  def dfs(v, p):
  
      if len(lis[v]) == 1:
          return 1
  
      pl = 0
      for nex in lis[v]:
          if nex != p:
              pl += dfs(nex, v)
  
      if pl >= 2:
          print("First")
          sys.exit()
  
      return 0
  
  
  fi = None
  for i in range(N):
      if len(lis[i]) > 1:
          fi = i
          break
  
  dfs(fi, fi)
  print("Second")
  
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"}]