#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;

#include <bits/stdc++.h>
using namespace std;

const int INF=1e9;

struct Edge{
  int to;
  int w;
  Edge(int to,ll w) : to(to),w(w) {}
};

using Graph=vector<vector<Edge>>;
using pli=pair<ll,int>;

int dist[100010];

template<class T> bool chmin(T& a,T b){
  if(a>b){
    a=b;
    return true;
  }
  return false;
}

int main(){
  int n;
  cin>>n;
  
  Graph G(n);
  rep(i,n-1){
    int a,b;
    cin>>a>>b;
    a--,b--;
    G[a].push_back(Edge(b,1));
    G[b].push_back(Edge(a,1));
  }
  
  int x=-1,y=-1;
  set<int> se;
  rep(i,n){
    if(G[i].size()==1){
      if(x==-1) x=i;
      else if(y==-1) y=i;
      se.insert(i);
    }
  }
  
  if(se.size()==2){
    cout<<"Yes"<<endl;
    return 0;
  }
  
  int s=x;
  rep(i,n) dist[i]=INF;
  dist[s]=0;
  
  priority_queue<pli,vector<pli>,greater<pli>> que;
  que.push({dist[s],s});
  
  while(!que.empty()){
    int v=que.top().second;
    ll d=que.top().first;
    que.pop();
    
    if(d>dist[v]) continue;
    
    for(auto e:G[v]){
      if(chmin(dist[e.to],dist[v]+e.w)){
        que.push({dist[e.to],e.to});
      }
    }
  }
  
  int di=dist[y];
  
  if(di%2==1){
    cout<<"No"<<endl;
    return 0;
  }
  
  int mid;
  rep(i,n){
    if(dist[i]==di/2){
      mid=i;
      break;
    }
  }
  
  s=mid;
  rep(i,n) dist[i]=INF;
  dist[s]=0;
  
  que.push({dist[s],s});
  
  while(!que.empty()){
    int v=que.top().second;
    ll d=que.top().first;
    que.pop();
    
    if(d>dist[v]) continue;
    
    for(auto e:G[v]){
      if(chmin(dist[e.to],dist[v]+e.w)){
        que.push({dist[e.to],e.to});
      }
    }
  }
  
  bool b=true;
  for(auto p:se){
    if(dist[p]!=di/2) b=false;
  }
  if(b) cout<<"Yes"<<endl;
  else cout<<"No"<<endl;

  return 0;
}