#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

//ifstream fin("omegalul.in");
//ofstream fout("omegalul.out");

ifstream fin("cerere.in");
ofstream fout("cerere.out");

const long N = 100005; //INF = 2e9;

long long n;
long long rad, sum;

vector <int> a[N];
int d[N], bck[N], asc[N];
bool viz[N];

void cit()
{
    fin>>n;

    sum = (n * (n + 1)) / 2;

    for (int i=1; i<=n; i++)
    {
        fin>>asc[i];
    }

    for (int i=1; i<n; i++)
    {
        int x, y;
        fin>>x>>y;

        a[x].push_back(y);

        sum -= y;
    }
}

void dfs(int x, int cap)
{
    viz[x] = true;

    bck[cap] = x;

    if (asc[x]) d[x] = 1;

    d[x] += d[bck[cap - asc[x]]];

    for (int i=0; i<a[x].size(); i++)
    {
        int y = a[x][i];

        if (!viz[y]) dfs(y, cap + 1);
    }
}

int main()
{
    cit();

    rad = sum;

    d[rad] = 0;

    dfs(rad, 1);

    for (int i=1; i<=n; i++)
        fout<<d[i]<<" ";

    return 0;
}