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

typedef long long ll;
typedef pair<int,int> P;

#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it)) {if ((it) == map.end()) {cout << "}\n";break;}else cout << "" << (it)->first << "=>" << (it)->second << ", ";}}while(0)


struct UnionFind {
private:
    vector<int> par,sizes;
public:
    UnionFind (int n) {
        par.resize(n);
        sizes = vector<int>(n,1);
        for (int i = 0;i < n;++i) par[i] = i;
    }

    int find(int x) {
        if (par[x] == x) return x;
        else return par[x] = find(par[x]);
    }

    void unite(int x,int y) {
        x = find(x);
        y = find(y);
        if (x == y) return;
        if (sizes[x] < sizes[y]) swap(x,y);
        par[y] = x;
        sizes[x] += sizes[y];
    }

    bool same(int x,int y) {
        return find(x) == find(y);
    }

    int size(int x) {
        return sizes[find(x)];
    }
};

int main() {
    int n;
    cin >> n;
    UnionFind uf(n);
    vector<int> cnt(n,0);
    for (int i = 0;i < n-1;++i) {
        int a,b;
        cin >> a >> b;
        uf.unite(a,b);
        cnt[a]++;
        cnt[b]++;
    }
    set<int> st;
    for (int i = 0;i < n;++i) st.insert(uf.find(i));
    if (st.size() > 2) cout << "Alice" << endl;
    else if (st.size() == 1) cout << "Bob" << endl;
    else {
        int a = 0,b = 0;
        for (int i = 0;i < n;++i) if (uf.same(i,0)) a++;
        for (int i = 0;i < n;++i) if (cnt[i] == 2) b++;
        cout << ((a == 1 || a == n-1) && b == n-1 ? "Bob" : "Alice")  << endl;
    }
}