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
// Arti1990, II UWr

#include <bits/stdc++.h>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,K,FUN)             ({auto SSS=P, PPP = P-1, KKK=(K)+1; while(PPP+1!=KKK) {SSS = (PPP+(KKK-PPP)/2); if(FUN(SSS)) KKK = SSS; else PPP = SSS;} PPP;})
#define testy()                     int _tests; cin>>_tests; FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#define FOR(i, a, b)                for(int i=a; i<=b; i++)
#define FORD(i, a, b)               for(int i=a; i>=b; i--)
#define MP                          make_pair
#define PB                          push_back
#define ff                          first
#define ss                          second
#define deb(X)                      X;

#define M 1000000007
#define INF 1000000007LL

using namespace std;

int n, a, b;
long long c, byl[1000007];
int res[1000007];
vector <int> v;

struct wierzcholek
{
    long long r;
    vector <pair<int, long long>> l;
};
wierzcholek tab[1000007];

int dfs(int nr, long long d, long long p_dist)
{
    d = max(d, tab[nr].r);
    if(byl[nr] >= d)
        return 0;
    if(tab[nr].r >= p_dist)
        v.PB(nr);
    int res = (byl[nr] == -1);
    byl[nr] = d;
    //cout << "wchodzi do " << nr << " z d = " << d << '\n';
    for(auto p : tab[nr].l)
        if(d >= p.ss)
            res += dfs(p.ff, d-p.ss, p_dist + p.ss);
    return res;
}

int solve()
{
    cin >> n;
    FOR(i, 1, n)
        cin >> tab[i].r;
    forr(i, n-1)
    {
        cin >> a >> b >> c;
        tab[a].l.PB({b, c});
        tab[b].l.PB({a, c});
    }

    FOR(i, 1, n)
    {
        if(res[i] == 0)
        {
            FOR(j, 1, n)
                byl[j] = -1;
            v.clear();
            res[i] = dfs(i, tab[i].r, 0);
            for (auto el : v)
            {
                res[el] = res[i];
                //cout << el << " ma przepisane od " << i << '\n';
            }
        }
        cout << res[i] << " ";
    }
    cout << '\n';

    return 0;
}

int main()
{
    std::ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    solve();

    return 0;
}