#include <bits/stdc++.h>

#define all(a) a.begin(),a.end()
#define len(a) (int)(a.size())
#define fir first
#define sec second
#define fi first
#define se second
#define mp make_pair
#define pb push_back

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;

template<typename T>
bool umin(T &a, T b) {
    if (b < a) {
        a = b;
        return 1;
    }
    return 0;
}

template<typename T>
bool umax(T &a, T b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}

#ifdef KIVI
#define DEBUG for (int _____DEBUG=1;_____DEBUG;_____DEBUG=0)
#define LOG(...) prnt(#__VA_ARGS__" ::",__VA_ARGS__)<<endl

template<class ...Ts>
auto &prnt(Ts ...ts) { return ((cerr << ts << " "), ...); }

#else
#define DEBUG while (false)
#define LOG(...)
#endif

const int max_n = 2e5+10, inf = 1000111222;

int n;
vector<int> reb[max_n];

vector<int> cands;

int sz[max_n];

bool dp[max_n];

template<bool build_cands___or__do_dp>
void dfs(int now,int pred)
{
    sz[now]=1;
    for (auto wh:reb[now]){
        if (wh!=pred){
            dfs<build_cands___or__do_dp>(wh,now);
            sz[now]+=sz[wh];
        }
    }

    if (build_cands___or__do_dp){
        vector<int> guys;
        for (auto wh:reb[now]){
            if (wh!=pred){
                guys.pb(sz[wh]);
            }
        }
        if (pred!=-1){
            guys.pb(n-sz[now]);
        }

        if (guys.empty() || 2*(*max_element(all(guys)))<=n){
            cands.pb(now);
        }
    }
    else{
        dp[now]=1;
        vector<int> s;
        for (auto wh:reb[now]){
            if (wh!=pred){
                dp[now]&=dp[wh];
                s.pb(sz[wh]);
            }
        }
        sort(all(s));
        int pref=1;
        for (auto i:s){
            dp[now]&=(i<=pref);
            pref+=i;
        }
        LOG(now+1,dp[now]);
    }
}

int main() {
//    freopen("input.txt","r",stdin);
//    freopen("output.txt","w",stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin>>n;
    for (int i=1;i<n;i++){
        int u,v;
        cin>>u>>v;
        u--;
        v--;
        reb[u].pb(v);
        reb[v].pb(u);
    }
    dfs<true>(0,-1);

    for (auto c:cands){
        dfs<false>(c,-1);
        LOG("cands",c+1,dp[c]);
        if (dp[c]){
            cout<<"YES"<<"\n";
            return 0;
        }
    }

    cout<<"NO"<<"\n";

    exit(0);
}