1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
#include<bits/stdc++.h>
using namespace std;
#ifdef LOC
template <class T, class U> auto &operator<<(ostream &out, pair<T, U> a) { return out << "(" << a.first << ", " << a.second << ")"; }
template <class T, class = class enable_if<!is_same<T, string>(), class T::iterator>::type> auto &operator<<(ostream &out, T a) {
    out << "{";
    bool fi = 1;
    for(auto b : a) {
        if(fi) {out<<b; fi=0;}
        else out<<", "<<b;
    }
    return out << "}";
}

template <class T, class X, class Y> auto &operator<<(ostream &out, const priority_queue<T,X,Y>& a) {auto b = a; vector<T> v; while(!b.empty()) {v.push_back(b.top()); b.pop();} return out<<v; }
void dump(){
   cerr << "\e[39m"<<"\n";
}
template <class T, class... Ts> void dump(T a, Ts... x) {
   cerr << a << ", ";
   dump(x...);
}
#define debug(...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<"\t"<<"[" #__VA_ARGS__ "]: ", dump(__VA_ARGS__)
#else
#define debug(...) ;
#endif

#define fwd(i, a, b) for(int i=(a);i<(int)(b);i++)
#define rep(i, n) for(int i=0;i<(int)(n);i++)
#define all(X) (X).begin(), (X).end()
#define sz(X) ((int)(X).size())
#define mp make_pair
#define st first
#define nd second
typedef long long ll;
typedef pair<int,ll> pil;
typedef vector<int> vi;

struct MyBitset{
    vector<uint64_t> v;
    const size_t S;
    MyBitset(int siz) : S(siz/64+1){
        v.resize(S);
    }

    const MyBitset& operator |= (const MyBitset&b) {
        rep(i,S)
            v[i] |= b.v[i];
        return *this;
    }

    void set(int pos) {
        v[pos>>6] |= 1ULL<<(uint64_t)(pos&63);
    }

    bool get(int pos) const {
        return (v[pos>>6]) & (1ULL<<(uint64_t)(pos&63));
    }

    int count() const {
        int res=0;
        for(auto&a: v)
            res += __builtin_popcount(a);
        return res;
    }
};

vector<MyBitset> g;

int32_t main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<ll> r(n);
    rep(i,n) cin >> r[i];
    vector<vector<pil> > tree(n);
    g = vector<MyBitset>(n,MyBitset(n));
    rep(i,n-1) {
        int a,b,d;
        cin >> a >> b >> d;
        tree[a-1].push_back(pil(b-1,d));
        tree[b-1].push_back(pil(a-1,d));
    }

    function<void(int,int,int,ll)> dfs = [&](int start, int cur, int p, ll rr) {
        g[start].set(cur);
        for(auto [a,d]: tree[cur]) if(a != p && rr >= d) {
            dfs(start, a,cur,rr-d);
        }
    };

    rep(i,n) dfs(i,i,-1,r[i]);

    rep(k,n)
        rep(i,n)
            if(g[i].get(k))
                g[i] |= g[k];
    
    rep(i,n) {
        cout<<g[i].count()<<" ";
    }
}