#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=100000000;
const ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}


void solve();

//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	int N;
	cin>>N;
	vector<vector<int>> G(N);
	rep(i,N-1){
		int a,b;
		cin>>a>>b;
		a--,b--;
		G[a].push_back(b);
		G[b].push_back(a);
	}
	vector<int> order={0},seen(N,1);
	seen[0]=-1;
	rep(i,N){
		int a=order[i];
		for(auto x:G[a]){
			if(seen[x]==1){
				order.push_back(x);
				seen[x]=-1;
			}
		}
	}
	int ind=order[N-1];
	order={ind};
	seen[ind]=-2;
	rep(i,N){
		int a=order[i];
		for(auto x:G[a]){
			if(x!=ind&&seen[x]==-1){
				seen[x]=a;
				order.push_back(x);
			}
		}
	}
	vector<int> p;
	ind=order[N-1];
	//cout<<ind<<"\n";
	while(ind!=-2){
		p.push_back(ind);
		ind=seen[ind];
	}
	if((int)(p.size())==N){
		yneos(1);
		return;
	}
	if((int)(p.size())%2==0){
		yneos(0);
		return;
	}
	ind=p[(int)(p.size())/2];
	set<int> s;
	rep(i,N) seen[i]=0;
	seen[ind]=1;
	order={ind};
	rep(i,N){
		int a=order[i];
		for(auto x:G[a]){
			if(seen[x]==0){
				seen[x]=seen[a]+1;
				order.push_back(x);
			}
		}
		if(G[a].size()==1) s.insert(seen[a]);//,cout<<seen[a]<<"\n";
		else if(a!=ind&&G[a].size()!=2){
			yneos(0);
			return ;
		}
	}
	yneos(s.size()==1);
}