// I SELL YOU...! 
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<chrono>
#include<iomanip>
#include<map>
#include<set>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
bool used[110000];
vector<ll> G[110000];
void init_io(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << setprecision(10);
}
void dfs(int s){
  if(used[s]) return;
  used[s] = true;
  for(int v:G[s]){
    dfs(v);
  }
}
signed main(){
  init_io();
  ll n;
  cin >> n;
  vector<ll> w(n-1),v(n-1);
  for(int i=0;i<n-1;i++){
    cin >> w[i] >> v[i];
    G[w[i]].push_back(v[i]);
    G[v[i]].push_back(w[i]);
  }
  dfs(0);
  ll cnt=0;
  ll no_line=0,two_line=0;
  for(int i=0;i<n;i++){
    if(!used[i]) cnt++;
    if(G[i].size()==0) no_line++;
    if(G[i].size()==2) two_line++;
  }
  if(cnt==0||(cnt==1&&no_line==1&&two_line==n-1)) cout <<"Bob\n";
  else cout <<"Alice\n";
}