/*** author: yuji9511 ***/
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
using vll = vector<ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
ostream& operator<<(ostream& os, lpair& h){ os << "(" << h.first << ", " << h.second << ")"; return os;}
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
template <class H,class... T>
void print(H&& h, T&&... t){cout<<h<<" \n"[sizeof...(t)==0];print(forward<T>(t)...);}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

void solve(){
    ll N;
    cin >> N;
    vector<vll> tree(N);
    rep(i,0,N-1){
        ll u,v;
        cin >> u >> v;
        u--; v--;
        tree[u].push_back(v);
        tree[v].push_back(u);
    }
    bool ok = true;
    ll cnt = 0;
    rep(i,0,N){
        if(tree[i].size() <= 2) cnt++;
    }
    if(cnt == N){
        print("Yes");
        return;
    }
    ll max_idx = -1, val = 0;
    rep(i,0,N){
        if(chmax(val, (ll)tree[i].size())){
            max_idx = i;
        }
    }
    vll child(N, 0);

    auto dfs = [&](auto dfs, ll cur, ll par) -> void {
        for(auto &e: tree[cur]){
            if(e == par) continue;
            dfs(dfs, e, cur);
            child[cur] += child[e];
        }
        child[cur]++;
    };

    dfs(dfs, max_idx, -1);
    map<ll,ll> mp;
    for(auto &e: tree[max_idx]){
        mp[child[e]]++;
    }
    if(mp.size() > 1 || cnt != N-1){
        ok = false;
    }

    if(ok){
        print("Yes");
    }else{
        print("No");
    }

}

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