#include <bits/stdc++.h>
using namespace std;
void preprocess(void) { return; }
vector<int> p, in, ss;
vector<vector<int> > adj;
void dfs(int v, int par = -1) {
  int flag = 0;
  for (auto x : adj[v]) {
    if (x == par) continue;
    flag = 1;
    ss[v]++;
    p[x] = v;
    dfs(x, v);
  }
  if (!flag) in.push_back(v);
}
vector<int> matched;
int ans = 0;
void dfs1(int v, int par = -1) {
  for (auto x : adj[v]) {
    if (x == par) continue;
    dfs(x, v);
  }
  if (par != -1 && !matched[v]) {
    if (matched[par]) {
      ans = 1;
    }
    matched[par] = 1;
    matched[v] = 1;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.precision(20);
  preprocess();
  int n;
  cin >> n;
  adj.resize(n + 1, vector<int>(0));
  ss.resize(n + 1);
  p.resize(n + 1, -1);
  for (auto i = (0); i < n - 1; i++) {
    int x, y;
    cin >> x >> y;
    adj[x].push_back(y);
    adj[y].push_back(x);
  }
  if (n % 2) {
    cout << "First" << endl;
    return 0;
  }
  dfs(1, -1);
  int flag = 0;
  vector<int> d(n + 1);
  while (!in.empty()) {
    int x = in.back();
    in.pop_back();
    if (p[x] == -1 || d[p[x]]) {
      flag = 1;
      break;
    }
    d[x] = 1;
    d[p[x]] = 1;
    if (p[p[x]] != -1) {
      ss[p[p[x]]]--;
      if (ss[p[p[x]]] == 0) {
        in.push_back(p[p[x]]);
      }
    }
  }
  if (flag)
    cout << "First" << endl;
  else
    cout << "Second" << endl;
}
