#include <bits/stdc++.h>

using i64 = long long;
using u64 = unsigned long long;

void solve() {
    int n;
    std::cin >> n;

    n += 1;

    std::vector<int> r(n);
    r[0] = 2200;
    std::vector<std::vector<int>> adj(n);
    for(int i = 1; i < n; i ++ ) {
        int f, v;
        std::cin >> f >> v;
        adj[f].push_back(i);
        r[i] = v;
    }
    
    std::vector<i64> w(n);
    auto dfs = [&](auto &self, int x, int p) -> void {
        if(not adj[x].size()) {
            w[x] = r[x];
            r[x] = -1;
            return;
        }
        for(auto y : adj[x]) {
            if(y == p) continue;
            self(self, y, x);
            w[x] += w[y];
        }

    };

    dfs(dfs, 0, -1);
    if(r[0] < w[0]) {
        std::cout << "NO" << '\n';
        return;
    }
    std::vector<int> a, b;
    for(int i = 1; i < n; i ++ ) {
        if(r[i] == -1) continue;
        a.push_back(r[i]);
        b.push_back(w[i]);
    }

    std::sort(a.begin(), a.end());
    std::sort(b.begin(), b.end());

    for(int i = 0; i < n; i ++ ) {
        if(a[i] < b[i]) {
            std::cout << "NO" << '\n';
            return;
        }
    }
    std::cout << "YES" << '\n';
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int T = 1;
    // std::cin >> T;

    while(T -- ) {
        solve();
    }

    return 0;
}