#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

template<bool directed = false>
struct Graph{
    struct edge{
        int to, id;
        edge(int to, int id) : to(to), id(id) {}
    };

    vector<vector<edge>> es;
    const int n;
    int m;

    Graph(int n) : es(n), n(n), m(0) {}

    void add_edge(int from, int to){
        es[from].emplace_back(to, m);
        if(!directed) es[to].emplace_back(from, m);
        m++;
    }
};

int main(){
    int N; cin >> N;

    Graph G(N);
    rep(i, N-1){
        int u, v; cin >> u >> v; u--, v--;
        G.add_edge(u, v);
    }

    vector<int> v;
    rep(i, N){
        if(sz(G.es[i]) == 1) v.eb(i);
    }

    if(sz(v) == 2) {cout << "Yes\n"; return 0;}

    int n = sz(v);
    vector<int> pre(n, -1);

    while(true){
        int cnt = 0;
        rep(i, n){
            if(sz(G.es[v[i]]) >= 3) cnt++;
        }
        
        if(cnt == n){
            bool flag = true;
            rep(i, n){
                if(v[i] != v[0]) flag = false;
            }
            cout << (flag? "Yes\n" : "No\n");
            return 0;
        }
        else if(cnt > 0){
            cout << "No\n";
            return 0;
        }
        else{
            rep(i, n){
                int nxt;
                each(e, G.es[v[i]]){
                    if(e.to != pre[i]) nxt = e.to;
                }
                pre[i] = v[i], v[i] = nxt;
            }
        }
    }
}