#include <bits/stdc++.h>
//#include <chrono>
//#pragma GCC optimize("Ofast")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()

using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;

ll N,M,H,W,Q,K,A,B;
string S;
using P = pair<ll, ll>;
const ll INF = (1LL<<60);

template<class T> bool chmin(T &a, const T b){
    if(a > b) {a = b; return true;}
    else return false;
}
template<class T> bool chmax(T &a, const T b){
    if(a < b) {a = b; return true;}
    else return false;
}
template<class T> void my_printv(std::vector<T> v,bool endline = true){
    if(!v.empty()){
        for(std::size_t i{}; i<v.size()-1; ++i) std::cout<<v[i]<<" ";
        std::cout<<v.back();
    }
    if(endline) std::cout<<std::endl;
}

void no(){
    cout<<"No"<<endl;
    exit(0);
}

void dfs(int p, int v, int len, mat &G){
    if(G[v].size() == 1){
        if(len != 0) no();
    }else{
        for(int to : G[v]){
            if(to != p) dfs(v, to, len - 1, G);
        }
    }
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cin>>N;
    mat G(N);
    vec num(N, 0);
    rep(i, N - 1){
        int a, b;
        cin>>a>>b;
        --a; --b;
        G[a].push_back(b);
        G[b].push_back(a);
    }
    rep(i, N) num[i] = G[i].size();
    int m = *max_element(ALL(num)), id = max_element(ALL(num)) - num.begin();
    if(N == 2 || m == 2){
        cout<<"Yes"<<endl;
    }else{
        rep(i, N) if(i != id && num[i] > 2) no();
        int len = (N - 1) / num[id];
        if(len * num[id] != N - 1) no();
        dfs(-1, id, len, G);
        cout<<"Yes"<<endl;
    }
}