#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long

int n;
vector<int> a;
vector<vector<int>> b;
vector<int> c;
vector<int> q;
void dfs(int u,int f){
	for (auto v:b[u]){
		if (v == f){
			continue;
		}
		dfs(v,u);
		c[u] += c[v];
	}
	if (b[u].size()==0){
		c[u] += a[u];
	}else{
		if (c[u] > a[u] && u != 0){
			q.push_back(u);
		}
	}
	// cout << u << " " << c[u] << endl;
	return;
}
void solve(){
	cin >> n;
	a.resize(n+1,0);
	b.resize(n+1);
	c.resize(n+1,0);
	a[0] = 0x3f3f3f3f3f3f3f;
	for (int i = 1;i<n+1;i++){
		int f;
		cin >> f;
		b[f].push_back(i);
		cin >> a[i];
	}
	dfs(0,0);
	// cout << q.size() << endl;
	if (q.size() > 1){
		cout << "NO" <<endl;
		return;
	}else if (q.size() == 0){
		cout<<"YES"<<endl;
	}else{
		for (int i = 1;i<n+1;i++){
			if (b[i].size() > 1 && a[i] >= c[q[0]] && 
			a[q[0]] >= c[i]){
				cout << "YES"<<endl;
				return;
			}
		}
		cout << "NO" <<endl;
	} 
    return;
}

signed main(){
    // freopen("input.txt","r",stdin);
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    int _ = 1;
    while (_--){
        solve();
    }
    return 0;
}