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
#include <bits/stdc++.h>
#include <random>
#define ll long long int
#define pb push_back
#define st first
#define nd second
#define pii pair<int,int>
#define mp make_pair
#define pll pair<long long,long long>
#define ld long double
#define ull unsigned long long
#define mt make_tuple
using namespace std;

const int nax = 6666;
const ll inf = 2e18;
bitset<nax> somsiady[nax];
vector<pll> adj[nax];
int n;
ll r[nax];

void bfs(int v){
    vector<ll> dist(n + 1, inf);
    dist[v] = 0;
    vector<int> Q;
    Q.pb(v);
    int wsk = 0;
    while(wsk < (int)Q.size()){
        int cur = Q[wsk++];
        for(pll go : adj[cur]){
            if(dist[go.st] == inf){
                dist[go.st] = dist[cur] + go.nd;
                Q.pb(go.st);
            }
        }
    }
    for(int i=1;i<=n;i++){
        if(dist[i] <= r[v]) somsiady[v][i] = true;
    }
}

void resolve(int v){
    bitset<nax> reachable = somsiady[v];
    bitset<nax> used;
    while(reachable.count() > used.count()){
        int g = (reachable ^ used)._Find_first();
        reachable |= somsiady[g];
        used[g] = true;
    }
    cout << reachable.count() << " ";
}

void solve(){
    cin >> n;
    for(int i=1;i<=n;i++) cin >> r[i];
    for(int i=1;i<n;i++){
        ll x, y, z; cin >> x >> y >> z;
        adj[x].pb(mp(y, z));
        adj[y].pb(mp(x, z));
    }
    for(int i=1;i<=n;i++) bfs(i);
    for(int i=1;i<=n;i++){
        resolve(i);
    }
    cout << "\n";
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    int tt = 1;
    // cin >> tt;
    while(tt--) solve();
    return 0;
}