#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>

using namespace std;

typedef long long LL;

inline void Read(int &Num)
{
	char c = getchar();
	bool Neg = false;
	while (c < '0' || c > '9') 
	{
		if (c == '-') Neg = true;
		c = getchar();
	}
	Num = c - '0'; c = getchar();
	while (c >= '0' && c <= '9')
	{
		Num = Num * 10 + c - '0';
		c = getchar();
	}
	if (Neg) Num *= -1;
}

const int MaxN = 200000 + 5, MaxNode = 7200000 + 5;

int n, m, Index;
int A[MaxN], Root[MaxN], Son[MaxNode][2], T[MaxNode];

LL Cnt;
LL Ans[MaxN], Sum[MaxNode];

struct Edge
{
	int v;
	Edge *Next;
} E[MaxN * 2], *P = E, *Point[MaxN];

inline void AddEdge(int x, int y)
{
	++P; P -> v = y;
	P -> Next = Point[x]; Point[x] = P;
}

inline void Update(int x)
{
	T[x] = T[Son[x][0]] + T[Son[x][1]];
	Sum[x] = Sum[Son[x][0]] + Sum[Son[x][1]];
}

void Add(int &x, int s, int t, int Pos, int Ds, int Dt)
{
	if (x == 0) x = ++Index;
	if (s == t)
	{
		Sum[x] += (LL)Ds;
		T[x] += Dt;
		return;
	}
	int m = (s + t) >> 1;
	if (Pos <= m) Add(Son[x][0], s, m, Pos, Ds, Dt);
	else Add(Son[x][1], m + 1, t, Pos, Ds, Dt);
	Update(x);
}

int Merge(int x, int y, int s, int t)
{
	if (!x) return y;
	if (!y) return x;
	if (s == t)
	{
		T[x] += T[y];
		Sum[x] += Sum[y];
		return x;
	}
	Cnt += (LL)T[Son[x][1]] * Sum[Son[y][0]];
	Cnt += (LL)T[Son[y][1]] * Sum[Son[x][0]];
	int m = (s + t) >> 1;
	Son[x][0] = Merge(Son[x][0], Son[y][0], s, m);
	Son[x][1] = Merge(Son[x][1], Son[y][1], m + 1, t);
	Update(x);
	return x;
}

void Solve(int x, int Fa)
{
	for (Edge *j = Point[x]; j; j = j -> Next)
	{
		if (j -> v == Fa) continue;
		Solve(j -> v, x);
	}
	for (Edge *j = Point[x]; j; j = j -> Next)
	{
		if (j -> v == Fa) continue;
		Cnt = 0;
		Root[x] = Merge(Root[x], Root[j -> v], 0, m);
		Ans[x] += Cnt;
	}
}

int main()
{
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; ++i) 
	{
		Read(A[i]);
		if (A[i] != 1) A[i] = 0;
	}
	int a, b;
	for (int i = 1; i < n; ++i) 
	{
		Read(a); Read(b);
		AddEdge(a, b); AddEdge(b, a);
	}
	for (int i = 1; i <= n; ++i)
		Add(Root[i], 0, m, 0, A[i] * i, 0);
	int f, x;
	for (int i = 1; i <= m; ++i)
	{
		Read(f); Read(x);
		if (f == 1) 
		{
			Add(Root[x], 0, m, i, 0, 1);
			if (A[x]) Ans[x] += (LL)x;
		}
		else
		{
			A[x] ^= 1;
			if (A[x]) Add(Root[x], 0, m, i, x, 0);
			else Add(Root[x], 0, m, i, -x, 0);
		}
	}
	Solve(1, 0);
	for (int i = 1; i <= n; ++i) 
		printf("%lld\n", Ans[i]);
	return 0;
}