#include <bits/stdc++.h>
using namespace std;
#if __has_include(<boost/multiprecision/cpp_int.hpp>)
	#include <boost/multiprecision/cpp_int.hpp>
	#include <boost/multiprecision/cpp_dec_float.hpp>
	using bll = boost::multiprecision::cpp_int;
	using bdouble = boost::multiprecision::cpp_dec_float_100;
	using namespace boost::multiprecision;
#endif
#ifdef LOCAL_DEV
	void debug_impl() { std::cerr << '\n'; }
	template<typename Head, typename... Tail> void debug_impl(Head head, Tail... tail) { std::cerr << " " << head << (sizeof...(tail) ? "," : ""); debug_impl(tail...); }
	#define debug(...) do { std::cerr << "(" << #__VA_ARGS__ << ") ="; debug_impl(__VA_ARGS__); } while (false)
#else
	#define debug(...) do {} while (false)
#endif
#ifdef LOCAL_TEST
	#define BOOST_STACKTRACE_USE_ADDR2LINE
	#define BOOST_STACKTRACE_ADDR2LINE_LOCATION /usr/local/opt/binutils/bin/addr2line
	#define _GNU_SOURCE
	#include <boost/stacktrace.hpp>
	namespace std {
		template<typename T> class dvector : public std::vector<T> {
		public:
			dvector() : std::vector<T>() {}
			explicit dvector(size_t n, const T& value = T()) : std::vector<T>(n, value) {}
			dvector(const std::vector<T>& v) : std::vector<T>(v) {}
			dvector(const std::initializer_list<T> il) : std::vector<T>(il) {}
			dvector(const std::string::iterator first, const std::string::iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::iterator first, const typename std::vector<T>::iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::reverse_iterator first, const typename std::vector<T>::reverse_iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::const_iterator first, const typename std::vector<T>::const_iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::const_reverse_iterator first, const typename std::vector<T>::const_reverse_iterator last) : std::vector<T>(first, last) {}
			T& operator[](size_t n) {
				try { return this->at(n); } catch (const std::exception& e) {
					std::cerr << boost::stacktrace::stacktrace() << '\n'; return this->at(n);
				}
			}
			const T& operator[](size_t n) const {
				try { return this->at(n); } catch (const std::exception& e) {
					std::cerr << boost::stacktrace::stacktrace() << '\n'; return this->at(n);
				}
			}
		};
	}
	class dbool {
	private:
		bool boolvalue;
	public:
		dbool() : boolvalue(false) {}
		dbool(bool b) : boolvalue(b) {}		
		dbool(const dbool&) = default;
		dbool(dbool&&) = default;
		dbool& operator=(const dbool&) = default;
		dbool& operator=(dbool&&) = default;
		operator bool&() { return boolvalue; }
		operator const bool&() const { return boolvalue; }
	};
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::dvector<T>& v) {
		for (size_t i = 0; i < v.size(); ++i){ s << v[i]; if (i < v.size() - 1) s << "\t"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::dvector<std::dvector<T>>& vv) {
		s << "\\\n"; for (size_t i = 0; i < vv.size(); ++i){ s << vv[i] << "\n"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::deque<T>& v) {
		for (size_t i = 0; i < v.size(); ++i){ s << v[i]; if (i < v.size() - 1) s << "\t"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::set<T>& se) {
		s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::multiset<T>& se) {
		s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
	template <typename T, size_t N> std::ostream& operator<<(std::ostream& s, const std::array<T, N>& a) {
		s << "{ "; for (size_t i = 0; i < N; ++i){ s << a[i] << "\t"; } s << "}"; return s; }
	template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::map<T1, T2>& m) {
		s << "{\n"; for (auto itr = m.begin(); itr != m.end(); ++itr){ s << "\t" << (*itr).first << " : " << (*itr).second << "\n"; } s << "}"; return s; }
	template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::pair<T1, T2>& p) {
		return s << "(" << p.first << ", " << p.second << ")"; }
	#define vector dvector
	#define bool dbool
	class SIGFPE_exception : std::exception {};
	class SIGSEGV_exception : std::exception {};
	void catch_SIGFPE([[maybe_unused]] int e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; throw SIGFPE_exception(); }
	void catch_SIGSEGV([[maybe_unused]] int e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; throw SIGSEGV_exception(); }
	signed convertedmain();
	signed main() { signal(SIGFPE, catch_SIGFPE); signal(SIGSEGV, catch_SIGSEGV); return convertedmain(); }
	#define main() convertedmain()
#endif
//#define int long long
using ll = long long;
//constexpr int INF = 1e9;//INT_MAX=(1<<31)-1=2147483647
constexpr ll INF = (ll)1e18;//(1LL<<63)-1=9223372036854775807
constexpr ll MOD = (ll)1e9 + 7;
constexpr double EPS = 1e-9;
constexpr ll dx[4] = {1LL, 0LL, -1LL, 0LL};
constexpr ll dy[4] = {0LL, 1LL, 0LL, -1LL};
constexpr ll dx8[8] = {1LL, 0LL, -1LL, 0LL, 1LL, 1LL, -1LL, -1LL};
constexpr ll dy8[8] = {0LL, 1LL, 0LL, -1LL, 1LL, -1LL, 1LL, -1LL};
#define rep(i, n)   for(ll i=0, i##_length=(n); i< i##_length; ++i)
#define repeq(i, n) for(ll i=1, i##_length=(n); i<=i##_length; ++i)
#define rrep(i, n)   for(ll i=(n)-1; i>=0; --i)
#define rrepeq(i, n) for(ll i=(n)  ; i>=1; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
void p() { std::cout << '\n'; }
template<typename Head, typename... Tail> void p(Head head, Tail... tail) { std::cout << head << (sizeof...(tail) ? " " : ""); p(tail...); }
template<typename T> inline void pv(std::vector<T>& v) { for(ll i=0, N=v.size(); i<N; i++) std::cout << v[i] << " \n"[i==N-1]; }
template<typename T> inline bool chmax(T& a, T b) { return a < b && (a = b, true); }
template<typename T> inline bool chmin(T& a, T b) { return a > b && (a = b, true); }
template<typename T> inline void uniq(std::vector<T>& v) { v.erase(std::unique(v.begin(), v.end()), v.end()); }

/*-----8<-----template-----8<-----*/


constexpr ll N_ary = 20;
template<typename T>
class PersistentArray{
public:
	struct node{
		T data;
		node* ch[N_ary];
	};
	node* root=nullptr;

	PersistentArray(){}
	node* get_root(){
		return root;
	}
	node* set(ll idx, T val, node*& t){
		node* res=new node();
		if(t){
			memcpy(res->ch, t->ch, sizeof(t->ch));
			res->data=t->data;
		}
		if(idx==0){
			res->data=val;
		}else{
			res->ch[idx%N_ary]=set(idx/N_ary, val, res->ch[idx%N_ary]);
		}
		return res;
	}
	void destructive_set(ll idx, T val, node*& t){
		if(!t)t=new node();
		if(idx==0){
			t->data=val;
		}else{
			destructive_set(idx/N_ary,val,t->ch[idx%N_ary]);
		}
	}
	T get(ll idx, node* t){
		if(!t)return 0;
		if(idx==0){
			return t->data;
		}else{
			return get(idx/N_ary, t->ch[idx%N_ary]);
		}
	}
};




vector<ll> lis(const vector<ll>& a) {
	const ll n = a.size();
	vector<ll> A(n, INF);
	vector<ll> id(n);
	for (ll i = 0; i < n; ++i) {
		id[i] = lower_bound(A.begin(), A.end(), a[i]) - A.begin();
		//id[i] = upper_bound(A.begin(), A.end(), a[i]) - A.begin(); //=を許容する場合
		A[ id[i] ] = a[i];
	}
	ll m = *max_element(id.begin(), id.end());
	vector<ll> b(m+1);
	for (ll i = n-1; i >= 0; --i)
		if (id[i] == m) b[m--] = a[i];
	return b;
}
/*-----8<-----library-----8<-----*/

constexpr ll N_MAX = 2*1e5;
constexpr ll A_I_MAX = 1e9;

ll N;
vector<ll> a;
vector<ll> u;
vector<ll> v;

void solve() {
	scanf("%lld", &N);
	a.assign(N, 0);
	rep(i, N) { scanf("%lld", &a[i]); }
	u.assign(N-1, 0);
	v.assign(N-1, 0);
	rep(i, N-1) { scanf("%lld%lld", &u[i], &v[i]); 
		u[i]--;v[i]--;
	}
	vector<vector<ll>> g(N);
	rep(i,N-1){
		g[v[i]].push_back(u[i]);
		g[u[i]].push_back(v[i]);
	}
	
	vector<ll> ans(N,0);
	PersistentArray<ll> pa;
	vector<PersistentArray<ll>::node*> nodev(N);
	PersistentArray<ll>::node* start=pa.get_root();
	nodev[0]=pa.set(0,a[0],start);

	vector<ll> length(N,-INF);
	length[0]=1;

	auto f=[&](auto&& f, vector<vector<ll>> &g, ll v,ll p)->void{
		debug(v);
		if(p!=-1){
			ll len=length[p];
			ll last=pa.get(len-1,nodev[p]);
			if(last<a[v]){
				nodev[v]=pa.set(len,a[v],nodev[p]);
				len++;
			}else{
				//初期は left->OK / right->NG になっています
				using rangetype = ll;
				rangetype left = -1;
				rangetype right = len;
				auto isOK = [&](rangetype val) -> bool {
					return pa.get(val,nodev[p])<a[v];
				};
				while((rangetype)abs(right - left) > 1) {
					rangetype mid = left + (right - left) / 2;
					if(isOK(mid)) left = mid;
					else right = mid;
				}
				nodev[v]=pa.set(right,a[v],nodev[p]);
			}
			length[v]=len;
		}
		
		for(ll nextv:g[v]){
			if(nextv==p)continue;
			f(f,g,nextv,v);
		}
	};
	f(f,g,0,-1);

	rep(i,N)printf("%lld\n", length[i]);
	
}

// https://atcoder.jp/contests/abc165/tasks/abc165_f
signed main() {
	solve();
	return 0;
}




Measured memory_bytes: 168612