#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for (int i=(int)(b); i<(int)(e); i++)
#define ALL(x) (x).begin(), (x).end()

const double PI = acos(-1);

class UFT {
  int n;
  int cnt;           // number of connected components
  vector<int> par;
  vector<int> rank;
  vector<int> sz;    // size of each component
public:
  UFT(int n) : n(n), cnt(n), par(n), rank(n), sz(n) {
    for (int i = 0; i < n; i++) {
      par[i] = i;
      sz[i] = 1;
    }
  }
  
  int find(int x) {
    return par[x] == x ? x : par[x] = find(par[x]);
  }
  
  void unite(int x, int y) {
    x = find(x);
    y = find(y);
    if (x == y) return;
    
    --cnt;
    if (rank[x] < rank[y]) {
      par[x] = y;
      sz[y] += sz[x];
    } else {
      par[y] = x;
      sz[x] += sz[y];
      if (rank[x] == rank[y])
        ++rank[x];
    }
    
  }
  
  bool same(int x, int y) {
    return find(x) == find(y);
  }
  
  int compCnt() {
    return cnt;
  }
  
  int size(int x) {
    return sz[find(x)];
  }
};

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n;
  cin >> n;

  vector<int> d(n);
  UFT tree(n);
  REP (i, n-1) {
    int v, u;
    cin >> v >> u;
    d[v]++, d[u]++;
    tree.unite(v, u);
  }

  int c = tree.compCnt();
  if (c == 1)
    cout << "Bob" << endl;
  else if (c == 2) {
    int sz = tree.size(0);
    REP (i, n) sz = min(sz, tree.size(i));
    if (sz == 1) {
      int z = 0;
      REP (i, n) if (tree.size(i) != 1) {
        if (d[i] == 1)
          ++z;
      }
      if (z)
        cout << "Alice" << endl;
      else
        cout << "Bob" << endl;
    } else
      cout << "Alice" << endl;
  }
  else
    cout << "Alice" << endl;
  
  return 0;
}