#include <bits/stdc++.h>

#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define lcm( a, b ) (a)/__gcd((a),(b))*(b)
#define endl '\n'

using namespace std;

typedef long long LL;
typedef pair< int, int > P;
typedef pair< LL, LL > LP;

static const int INF = INT_MAX;
static const LL LINF = LLONG_MAX;
static const int MIN = INT_MIN;
static const LL LMIN = LLONG_MIN;
static const int MOD = 1000000007;
static const int SIZE = 200005;

const int dx[] = {0, -1, 1, 0};
const int dy[] = {-1, 0, 0, 1};

LL fac[SIZE], finv[SIZE], inv[SIZE];
void combInit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for( int i = 2; i < SIZE; ++i ) {
        fac[i] = (fac[i - 1] * i) % MOD;
        inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
        finv[i] = (finv[i - 1] * inv[i]) % MOD;

    }
}

LL comb(int n, int k) {
    if( n < k ) return 0;
    if( n < 0 || k < 0 ) return 0;
    return (fac[n] * (finv[k] * finv[n - k] % MOD)) % MOD;

}

vector< int > Div( int n ) {
    vector< int > ret;
    for( int i = 1; i * i <= n; ++i ) {
        if( n % i == 0 ) {
            ret.pb( i );

            if( i * i != n ) ret.pb( n / i );
        }
    }
    sort( all( ret ) );
    return ret;
}

void Init();
int Root(int x);
bool Unite(int x, int y);

vector< int > graph[SIZE];

int root[SIZE];

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

    int n;
    Init();
    cin >> n;
    for( int i = 0; i < n - 1; ++i ) {
        int a, b;
        cin >> a >> b;
        ++a; ++b;
        graph[a].pb(b);
        graph[b].pb(a);
        Unite(a, b);

    }

    set< int > st;
    for( int i = 1; i <= n; ++i ) {
        st.insert(Root(i));

    }
    if( st.size() > 2 ) {
        cout << "Alice" << endl;

    } else if( st.size() == 1 ) {
        cout << "Bob" << endl;

    } else {
        bool flg = true;
        for( auto p = st.begin(); p != st.end(); ++p ) {
            int rt = *p;
            for( int i = 1; i <= n; ++i ) {
                if( rt == Root(i) ) {
                    if( graph[i].size() <= 1 ) {
                        flg = false;

                    }
                }
            }
            if( !flg ) {
                cout << "Alice" << endl;
                return 0;

            }
        }
        cout << "Bob" << endl;

    }

    return 0;
}

void Init() {
    for( int i = 0; i < SIZE; ++i ) {
        root[i] = i;

    }

    return;
}

int Root(int x) {
    if( x == root[x] ) return x;
    return root[x] = Root(root[x]);

}

bool Unite(int x, int y) {
    int rx, ry;
    rx = Root(x);
    ry = Root(y);

    if( rx == ry ) return false;
    if( rx < ry ) {
        root[y] = rx;

    } else {
        root[x] = ry;

    }

    return true;
}