#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

struct Node {
    ll tsum;
    ll size;
    ll psum;
    ll wsum;
};

void prep(vector<vector<pair<int, ll>>> &adj, vector<ll> &taxes, vector<Node> &vals, int n, int p){    
    vals[n].tsum = taxes[n];
    vals[n].size = 1;
    vals[n].psum = 0;
    vals[n].wsum = 0;

    for(auto &v : adj[n]){
        if(v.first != p){
            prep(adj, taxes, vals, v.first, n);

            vals[n].tsum += vals[v.first].tsum;
            vals[n].size += vals[v.first].size;
            vals[n].psum += vals[v.first].psum + v.second * vals[v.first].tsum;
            vals[n].wsum += vals[v.first].wsum + v.second * vals[v.first].size;
        }
    }
}

void push(vector<vector<pair<int, ll>>> &adj, vector<ll> &taxes, vector<Node> &vals, vector<ll> &ans, int n, int p, ll pw){    
    ll p_tsum = vals[p].tsum - vals[n].tsum;
    ll p_size = vals[p].size - vals[n].size;
    ll p_psum = vals[p].psum - vals[n].psum - pw * vals[n].tsum;
    ll p_wsum = vals[p].wsum - vals[n].wsum - pw * vals[n].size;

    vals[n].tsum += p_tsum;
    vals[n].size += p_size;
    vals[n].psum += p_psum + pw * p_tsum;
    vals[n].wsum += p_wsum + pw * p_size;

    ans[n] = vals[n].psum + vals[n].wsum * taxes[n];

    for(auto &v : adj[n]){
        if(v.first != p){
            push(adj, taxes, vals, ans, v.first, n, v.second);
        }
    }
}

int main(){
    cin.tie(NULL)->sync_with_stdio(false);

    int n;
    cin >> n;

    vector<ll> taxes(n);
    for(int i = 0; i < n; i++)
        cin >> taxes[i];

    vector<vector<pair<int, ll>>> adj(n, vector<pair<int, ll>>());
    for(int i = 0; i < n-1; i++){
        int u, v, w;
        cin >> u >> v >> w;

        u--;
        v--;

        adj[u].push_back({v, w});
        adj[v].push_back({u, w});
    }

    if(n == 1){
        cout << "0\n";

        return 0;
    }

    vector<Node> vals(n, Node());

    int lnode, oonode, lweight;

    for(int i = 0; i < n; i++){
        if(adj[i].size() == 1){
            lnode = i;
            oonode = adj[i][0].first;
            lweight = adj[i][0].second;

            break;
        }
    }

    prep(adj, taxes, vals, lnode, -1);

    vector<ll> ans(n);

    ans[lnode] = vals[lnode].psum + vals[lnode].wsum * taxes[lnode];

    push(adj, taxes, vals, ans, oonode, lnode, lweight);

    for(int v : ans)
        cout << v << "\n";
}