#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}void pr(){ln;}
template<class A,class...B>void pr(const A &a,const B&...b){cout<<a<<(sizeof...(b)?" ":"");pr(b...);}
template<class A>void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")<<a[i];ln;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[8]={-1,0,1,0,-1,-1,1,1},dy[8]={0,1,0,-1,-1,1,1,-1};
typedef pair<ll,ll> P;

vector<ll> v[111111];
int d[111111];

P dfs(int x,int t) {
  d[x]=t;P p=P(d[x],x);
  rep(i,v[x].size())if(d[v[x][i]]==MAX)p=max(p,dfs(v[x][i],t+1));
  return p;
}

P calc() {
  fill(d,d+111111,MAX);P p=dfs(0,0);
  fill(d,d+111111,MAX);P q=dfs(p.S,0);
  return P(p.S,q.S);
}

void Main() {
  ll n;
  cin >> n;
  rep(i,n-1) {
    ll x,y;
    cin >> x >> y;
    x--,y--;
    v[x].pb(y);
    v[y].pb(x);
  }
  P p=calc();
  set<ll> s[2];
  rep(i,n) {
    if(v[i].size()==1&&p.F!=i) s[0].in(d[i]);
  }
  fill(d,d+111111,MAX);
  P q=dfs(p.S,0);
  rep(i,n) {
    if(v[i].size()==1&&p.S!=i) s[1].in(d[i]);
  }
  if(s[0].size()==1&&s[1].size()==1) pr("Yes");
  else pr("No");
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}