#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

vector<int> g[100000];
int depth[100000];
bool used[100000];

void dfs(int v, int d){
    used[v] = true;
    depth[v] = d;
    for(int to : g[v]){
        if(!used[to]) dfs(to, d+1);
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
    vector<int> deg(n);
    for(int i = 0; i < n-1; i++){
        int a, b; cin >> a >> b;
        a--; b--;
        deg[a]++;
        deg[b]++;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    int cnt = 0;
    for(int i = 0; i < n; i++){
        if(deg[i] >= 3) cnt++;
    }
    if(cnt > 1){
        cout << "No" << endl;
        return 0;
    }else if(cnt == 0){
        cout << "Yes" << endl;
        return 0;
    }
    for(int i = 0; i < n; i++){
        if(deg[i] >= 3) dfs(i, 0);
    }
    set<int> st;
    for(int i = 0; i < n; i++){
        if(deg[i] == 1){
            st.insert(depth[i]);
        }
    }
    if(st.size() == 1){
        cout << "Yes" << endl;
    }else{
        cout << "No" << endl;
    }
}