#include <functional>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
const ll MOD = 1000000007LL;

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

    int n;
    cin >> n;

    vector < vector <int> > edge(n);
    for (int i = 1; i < n; i++) {
        int u, v;
        cin >> u >> v;
        edge[u].push_back(v);
        edge[v].push_back(u);
    }

    int isolated = 0;
    int have_one_edge = 0;
    for (int i = 0; i < n; i++) {
        if (edge[i].size() == 0) {
            isolated++;
        } else if (edge[i].size() == 1) {
            have_one_edge++;
        }
    }

    if (isolated >= 2 || (isolated == 1 && have_one_edge)) {
        cout << "Alice" << '\n';
    } else {
        cout << "Bob" << '\n';
    }

    return 0;
}