#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
const int INF = 1ll << 60;
const int MOD = 1e9 + 7;
#define dump(x)                             \
    if (dbg) {                              \
        cerr << #x << " = " << (x) << endl; \
    }
#define overload4(_1, _2, _3, _4, name, ...) name
#define FOR1(n) for (ll i = 0; i < (n); ++i)
#define FOR2(i, n) for (ll i = 0; i < (n); ++i)
#define FOR3(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)
#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
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;
}
void Yes(bool flag = true) {
    if (flag)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
}
void No(bool flag = true) {
    Yes(!flag);
}
void YES(bool flag = true) {
    if (flag)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
}
void NO(bool flag = true) {
    YES(!flag);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T& val) {
    std::fill((T*)array, (T*)(array + N), val);
}
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define SZ(x) ((int)(x).size())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vp vector<pair<int, int>>
#define vvp vector<vector<pair<int, int>>>
#define pi pair<int, int>
//#define P pair<int, int>
//#define V vector<int>
//#define S set<int>
#define itn int
#define asn ans
bool dbg = false;


int N;
itn A[101010];
vi G[101010];

bool flag = true;

int dfs(int idx, int par) {
    if (G[idx].size() == 1) {
        return A[idx];
    }
    int SUM = 0;
    vi V;
    for (auto& nxt : G[idx]) {
        if (nxt != par) {
            int tmp = dfs(nxt, idx);
            SUM += tmp;
            V.pb(tmp);
            //cout << nxt + 1 << " : " << tmp << endl;
        }
    }

    int b = SUM - A[idx];
    itn c = A[idx] - b;
    if (b < 0 || c < 0) {
        flag = false;
        return 0;
    }

    sort(all(V), greater<int>());
    if (V[0] >= SUM / 2) {
        if (b > SUM - V[0]) {
            flag = false;
            return 1;
        }
    } else {
        if (b > SUM / 2) {
            flag = false;
            return 1;
        }
    }

    return c;
}

void solve() {
    if (N == 2) {
        YES(A[0] == A[1]);
        return;
    }
    int root;
    FOR(N) {
        if (G[i].size() != 1) {
            root = i;
            break;
        }
    }
    itn tmp = dfs(root, -1);
    if (!flag) {
        NO();
        return;
    }
    YES(tmp == 0);
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    cin >> N;
    FOR(N)
    cin >> A[i];
    FOR(N - 1) {
        int a, b;
        cin >> a >> b;
        a--;
        b--;
        G[a].eb(b);
        G[b].eb(a);
    }

    solve();
    return 0;
}


Measured memory_bytes: 15872