#include<bits/stdc++.h>
using namespace std;

#define all(v) v.begin(),v.end()
using ll = long long;
using ull = unsigned long long;
using vll=vector<ll>;
using vvll = vector<vector<ll>>;


vector<ll> par,Rank;

struct unionfind{
    ll N;
    vector<ll> par,Rank,Size;
    unionfind(ll n):N(n){
        par=vector<ll>(N),Rank=vector<ll>(N,1),Size=vector<ll>(N,1);
        for(int i=0;i<N;i++) par[i]=i;
    };
    ll find(ll x){
        if(par[x]==x) return x;
        else return par[x]=find(par[x]);
    }

    bool same(ll a,ll b){
        return find(a)==find(b);
    }

    void unite(ll a,ll b){
        if(same(a,b))return;
        a=find(a);
        b=find(b);
        ll s=Size[a]+Size[b];
        if(Rank[b]>Rank[a]) par[a]=b;
        else par[b]=a;
        if(Rank[a]==Rank[b]) Rank[a]++;
        Size[find(a)]=s;
    }

    ll size(ll a){
       return Size[find(a)];
    }
};

int main(){
    ll N;
    cin>>N;
    unionfind uf(N);
    vll A(N);
    for(int i=0;i<N-1;i++){
        ll a,b;
        cin>>a>>b;
        uf.unite(a,b);
        A[a]++;A[b]++;
    }
    ll cnt=0;
    vll c(N+1);
    for(int i=0;i<N;i++){
        if(i==uf.find(i))cnt++,c[uf.size(i)]++;
    }
    if(cnt==1){
        cout << "Bob" << endl;
        return 0;
    }
    for(int i=0;i<N;i++){
        if(A[i]==1){
            cout << "Alice" << endl;
            return 0;
        }
    }
    if(cnt==2&&c[1]==1){
        cout << "Bob" << endl;
        return 0;
    }
    cout << "Alice" << endl;
}