Problem: You are given an undirected tree of n vertices. 

Some vertices are colored blue, some are colored red and some are uncolored. It is guaranteed that the tree contains at least one red vertex and at least one blue vertex.

You choose an edge and remove it from the tree. Tree falls apart into two connected components. Let's call an edge nice if neither of the resulting components contain vertices of both red and blue colors.

How many nice edges are there in the given tree?

Input

The first line contains a single integer n (2 ≤ n ≤ 3 ⋅ 10^5) — the number of vertices in the tree.

The second line contains n integers a_1, a_2, ..., a_n (0 ≤ a_i ≤ 2) — the colors of the vertices. a_i = 1 means that vertex i is colored red, a_i = 2 means that vertex i is colored blue and a_i = 0 means that vertex i is uncolored.

The i-th of the next n - 1 lines contains two integers v_i and u_i (1 ≤ v_i, u_i ≤ n, v_i ≠ u_i) — the edges of the tree. It is guaranteed that the given edges form a tree. It is guaranteed that the tree contains at least one red vertex and at least one blue vertex.

Output

Print a single integer — the number of nice edges in the given tree.

Examples

Input


5
2 0 0 1 2
1 2
2 3
2 4
2 5


Output


1


Input


5
1 0 0 0 2
1 2
2 3
3 4
4 5


Output


4


Input


3
1 1 2
2 3
1 3


Output


0

Note

Here is the tree from the first example:

<image>

The only nice edge is edge (2, 4). Removing it makes the tree fall apart into components \{4\} and \{1, 2, 3, 5\}. The first component only includes a red vertex and the second component includes blue vertices and uncolored vertices.

Here is the tree from the second example:

<image>

Every edge is nice in it.

Here is the tree from the third example:

<image>

Edge (1, 3) splits the into components \{1\} and \{3, 2\}, the latter one includes both red and blue vertex, thus the edge isn't nice. Edge (2, 3) splits the into components \{1, 3\} and \{2\}, the former one includes both red and blue vertex, thus the edge also isn't nice. So the answer is 0.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int M = 998244353;
int n;
vector<int> v;
vector<set<int> > g;
int all[300011] = {};
set<pair<int, int> > ed;
pair<int, int> DFS(int u, int p) {
  pair<int, int> ret(v[u], 1);
  if (v[u] == 0) ret = {-1, 0};
  for (auto v : g[u])
    if (v != p) {
      auto cur = DFS(v, u);
      if (cur.first == -1) {
        ed.insert({min(u, v), max(u, v)});
        continue;
      }
      if (ret.first == -1 || cur.first == ret.first) {
        ret.first = cur.first;
        ret.second += cur.second;
      } else {
        puts("0");
        exit(0);
      }
    }
  if (ret.first == -1) return ret;
  if (all[ret.first] == ret.second) ret = {-1, 0};
  return ret;
}
vector<vector<int> > gr;
int w[300003];
int p[300003];
int find(int u) {
  if (p[u] == u) return u;
  return p[u] = find(p[u]);
}
int dp[300003][2];
int calc(int u, int p, int st) {
  int &ret = dp[u][st];
  if (ret != -1) return ret;
  if (st == 0 && w[u] > 0) return ret = calc(u, p, 1);
  ret = 0;
  if (st == 1) {
    ret = 1;
    for (auto &v : gr[u])
      if (v != p)
        ret =
            ret * (long long)(calc(v, u, 0) + calc(v, u, 1) * (w[v] == 0)) % M;
  } else {
    vector<int> pre(gr[u].size());
    long long mul = 1;
    for (int i = 0; i < gr[u].size(); ++i) {
      int v = gr[u][i];
      pre[i] = mul;
      if (v == p) continue;
      mul = mul * (calc(v, u, 0) + calc(v, u, 1) * (w[v] == 0)) % M;
    }
    mul = 1;
    for (int i = (int)gr[u].size() - 1; i >= 0; --i) {
      int v = gr[u][i];
      if (v == p) continue;
      ret = (ret + calc(v, u, 0) * mul % M * pre[i]) % M;
      mul = mul * (calc(v, u, 0) + calc(v, u, 1) * (w[v] == 0)) % M;
    }
  }
  return ret;
}
int main() {
  int k;
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; ++i) p[i] = i;
  v.resize(n);
  g.resize(n);
  for (auto &x : v) {
    scanf("%d", &x);
    ++all[x];
  }
  for (int i = 0; i < n; ++i) w[i] = v[i];
  for (int i = 1, a, b; i < n; ++i) {
    scanf("%d%d", &a, &b);
    --a;
    --b;
    g[a].insert(b);
    g[b].insert(a);
  }
  {
    queue<int> q;
    for (int i = 0; i < n; ++i)
      if (v[i] == 0 && g[i].size() == 1) q.push(i);
    while (!q.empty()) {
      int u = q.front();
      q.pop();
      int v = *g[u].begin();
      g[u].erase(v);
      g[v].erase(u);
      if (g[v].size() == 1 && w[v] == 0) q.push(v);
    }
  }
  int root;
  for (int i = 0; i < n; ++i)
    if (g[i].size()) {
      root = i;
      break;
    }
  DFS(root, -1);
  gr.resize(n);
  for (int i = 0; i < g.size(); ++i)
    for (auto x : g[i]) {
      int u = i;
      int v = x;
      if (u > v) swap(u, v);
      if (ed.find({u, v}) == ed.end()) {
        u = find(u);
        v = find(v);
        p[u] = v;
        w[v] = max(w[v], w[u]);
      }
    }
  for (int i = 0; i < g.size(); ++i)
    for (auto x : g[i]) {
      int u = i;
      int v = x;
      if (u > v) continue;
      if (ed.find({u, v}) != ed.end()) {
        u = find(u);
        v = find(v);
        gr[u].push_back(v);
        gr[v].push_back(u);
      }
    }
  for (int i = 0; i < gr.size(); ++i)
    if (gr[i].size() && w[i]) {
      root = i;
      break;
    }
  memset(dp, -1, sizeof(dp));
  printf("%d\n", calc(root, -1, 1));
  return 0;
}