题目链接:https://codeforces.com/contest/1118/problem/F1
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=3e5+2;
int a[maxn];
int dp[maxn][3];
int sum1,sum2,n;
vector<int> v[maxn];
int ans=0;
void dfs(int t,int f){
for(int i=0;i<v[t].size();i++){
int u=v[t][i];
if(u==f) continue;
dfs(u,t);
if(dp[u][1]==sum1&&dp[u][2]==0) ans++;
else if(dp[u][1]==0&&dp[u][2]==sum2) ans++;
dp[t][1]+=dp[u][1];
dp[t][2]+=dp[u][2];
}
dp[t][a[t]]++;
}
int main()
{
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
if(a[i]==1) sum1++;
if(a[i]==2) sum2++;
}
for(int i=1;i<n;i++){
int x,y;
cin>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
dfs(1,0);
cout<<ans<<endl;
return 0;
}