(联考)noip83

#include<cstdio>
#include<cctype>
#include<algorithm>
#define re register
const int MAX = 1e6+7;
#define scanf oma=scanf
#define freopen file=freopen
using std::sort;
using std::unique;
using std::lower_bound;
int oma;
FILE* file;
namespace some
{
	struct stream
	{
		template<typename type>inline stream &operator >>(type &s)
		{
			bool w=0; s=0; char ch=getchar();
			while(!isdigit(ch)){ w|=ch=='-'; ch=getchar(); }
			while(isdigit(ch)){ s=(s<<1)+(s<<3)+(ch^48); ch=getchar(); }
			return s=w?-s:s,*this;
		}
	}cin;
	int n,q,w[MAX];
	int tmp[MAX],tot;
	#define debug(s) printf("%s\n",s)
}using namespace some;
namespace Binary_Index_Tree
{
	struct BIT
	{
		int val[MAX];
		#define lowbit(x) x&-x
		void modify(int x,int w)
		{ for(re int i=x; i<=n+1; i+=lowbit(i)) { val[i] += w; } }
		int query(int x,int res = 0)
		{ for(re int i=x; i; i-=lowbit(i)) { res += val[i]; } return res; }
	}bit;
}using namespace Binary_Index_Tree;
namespace Graph
{
	struct graph
	{ int next,to; }edge[MAX<<1];
	int cnt=1,head[MAX];
	auto add = [](int u,int v) { edge[++cnt] = (graph){head[u],v},head[u] = cnt; };
	int g[MAX][2]; // 0 fa 1 self
	long long f[MAX];
	void dfs_rt(int u,int fa)
	{
		bit.modify(w[u],1);
		for(re int i=head[u],v; i; i=edge[i].next)
		{
			v = edge[i].to;
			if(v!=fa)
			{ f[1] += bit.query(n+1)-bit.query(w[v]); dfs_rt(v,u); }
		}
		bit.modify(w[u],-1);
	}
	void dfs_pre(int u,int fa)
	{
		g[u][1] -= bit.query(w[u]-1);
		if(u!=1) { g[u][0] -= bit.query(w[fa]-1); }
		bit.modify(w[u],1);
		for(re int i=head[u],v; i; i=edge[i].next)
		{
			v = edge[i].to;
			if(v!=fa)
			{ dfs_pre(v,u); }
		}
		g[u][1] += bit.query(w[u]-1);
		if(u!=1) { g[u][0] += bit.query(w[fa]-1); }
	}
	void dfs_ex(int u,int fa)
	{
		for(re int i=head[u],v; i; i=edge[i].next)
		{
			v = edge[i].to;
			if(v!=fa)
			{ f[v] = f[u]-g[v][0]+bit.query(w[v]-1)-g[v][1]; dfs_ex(v,u); }
		}
	}
}using namespace Graph;
namespace right
{
	auto solve = []() -> void
	{
		for(re int i=1; i<=n; i++)
		{ tmp[i] = w[i]; }
		sort(tmp+1,tmp+1+n);
		//printf("%d\n",lower_bound(tmp+1,tmp+1+n,w[2])-tmp-1);
		tot = unique(tmp+1,tmp+1+n)-tmp-1;
		for(re int i=1; i<=n; i++)
		{ w[i] = lower_bound(tmp+1,tmp+1+tot,w[i])-tmp; }
		dfs_rt(1,0),dfs_pre(1,0),dfs_ex(1,0);
		for(re int i=1,u; i<=q; i++)
		{ cin >> u; printf("%lld\n",f[u]); }
	};
};
namespace OMA
{
	auto main = []() -> signed
	{
		//freopen("node.in","r",stdin); freopen("my.out","w",stdout);
		freopen("tears.in","r",stdin); freopen("tears.out","w",stdout);
		cin >> n >> q;
		for(re int i=1; i<=n; i++)
		{ cin >> w[i]; }
		for(re int i=1,u,v; i<n; i++)
		{ cin >> u >> v; add(u,v),add(v,u); }
		right::solve();
		return 0;
	};
}
signed main()
{ return OMA::main(); }