#include <cassert>
#include <iostream>
#include <set>
#include <vector>
using namespace std;

template <class T> struct Manager {
    T lo_sum = 0;
    T hi_sum = 0;

    multiset<T> lo; // size(lo) >= size(hi) holds
    multiset<T> hi;

    bool empty() const { return lo.empty(); }

    int size() const { return lo.size() + hi.size(); }

    T min() const {
        assert(!empty());
        return *lo.begin();
    }

    T max() const {
        assert(!empty());
        return hi.empty() ? *lo.rbegin() : *hi.rbegin();
    }

    T median_floor() const {
        assert(!empty());
        return *lo.rbegin();
    }

    T median_ceil() const {
        assert(!empty());
        return lo.size() == hi.size() ? *hi.begin() : *lo.rbegin();
    }

    T solve() const {
        if (size() <= 1) return 0;

        const int nlo = lo.size();
        const int nhi = hi.size();

        T med = *lo.rbegin();
        T ret = hi_sum - med * nhi + med * nlo - lo_sum;
        return ret;
    }

    void balance() {

        while (!lo.empty() and !hi.empty() and *lo.rbegin() > *hi.begin()) {
            T max_lo = *lo.rbegin();
            T min_hi = *hi.begin();
            lo.erase(prev(lo.end()));
            hi.erase(hi.begin());
            lo.insert(min_hi);
            hi.insert(max_lo);
            lo_sum += min_hi - max_lo;
            hi_sum += max_lo - min_hi;
        }

        while (lo.size() > hi.size() + 1) {
            hi.insert(*lo.rbegin());
            hi_sum += *lo.rbegin();
            lo_sum -= *lo.rbegin();
            lo.erase(prev(lo.end()));
        }

        while (hi.size() > lo.size()) {
            lo.insert(*hi.begin());
            lo_sum += *hi.begin();
            hi_sum -= *hi.begin();
            hi.erase(hi.begin());
        }
    }

    void add(T x) {
        if (lo.empty() or x <= *lo.rbegin()) {
            lo.insert(x);
            lo_sum += x;
        } else {
            hi.insert(x);
            hi_sum += x;
        }
        balance();
    }

    void erase(T x) {
        if (lo.count(x)) {
            lo.erase(lo.find(x));
            lo_sum -= x;
        } else if (hi.count(x)) {
            hi.erase(hi.find(x));
            hi_sum -= x;
        } else {
            return;
        }
        balance();
    }
};

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

    int N;
    cin >> N;
    vector<int> A(N + 1);
    for (auto &a : A) cin >> a;

    vector<vector<int>> to(N + 1);

    for (int e = 0; e < N; ++e) {
        int a, b;
        cin >> a >> b;
        to.at(a).push_back(b);
        to.at(b).push_back(a);
    }

    Manager<long long> manager;

    vector<long long> ret(N, -1);

    auto rec = [&](auto &&self, int now, int prv) -> void {
        manager.add(A.at(now));

        if (now) {
            if (manager.size() <= 2) {
                ret.at(now - 1) = -1;
            } else {
                int max = manager.max();
                int min = manager.min();
                if (max == min) {
                    ret.at(now - 1) = 1;
                } else {
                    manager.erase(max);
                    auto tmp = manager.solve();
                    manager.add(max);
                    manager.erase(min);
                    tmp = std::min(tmp, manager.solve());
                    manager.add(min);
                    ret.at(now - 1) = tmp;
                }
            }
        }

        for (int nxt : to.at(now)) {
            if (nxt == prv) continue;
            self(self, nxt, now);
        }

        manager.erase(A.at(now));
    };

    rec(rec, 0, -1);

    for (auto r : ret) cout << r << '\n';
}