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 JAVA):

Solution:
/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
//package Round540Div3;

import java.util.ArrayList;
import java.util.Scanner;

/**
 *
 * @author Hemant Dhanuka
 */


//Thoda neat code likhne ki koshish
//by reducing variables

public class F11 {
    
    static class Node{
    int sumChildR;
    int sumChildB;
    int nodeColorR;
    int nodeColorB;
    boolean visited;
    }
    
    
    static Node nodes[];
    static int ans=0;
    static ArrayList<Integer> edges[];
    static int totalRed=0;
    static int totalBlue=0;
    
    
    public static void main(String[] args) {
        Scanner s=new Scanner(System.in);
        
        int n=s.nextInt();
        
        nodes=new Node[n+1];
        
        for(int i=1;i<=n;i++){
            nodes[i]=new Node();
        }
        
        
        
        for(int i=1;i<=n;i++){
            int color=s.nextInt();
            if(color==1){
                nodes[i].nodeColorR=1;
                totalRed++;
            }
            else if(color==2){
             nodes[i].nodeColorB=1;

                totalBlue++;
            }
        }
        
        
        
        edges=new ArrayList[n+1];
        
        for(int i=1;i<=n;i++){
            edges[i]=new ArrayList<>();
            
        }
        
        for(int i=1;i<=n-1;i++){
            int node1=s.nextInt();
            int node2=s.nextInt();
            
            edges[node1].add(node2);
            edges[node2].add(node1);

        }
        
        
        dfs(1);
        
        System.out.println(ans);
        //we are assuming root node of tree 1
        
        
    }
    
    
    static void dfs(int root){
        
        ArrayList<Integer>  edge=edges[root];
        
        //currnet node color
        int tempSumR=nodes[root].nodeColorR;
        int tempSumB=nodes[root].nodeColorB;
        
        
        for(int i=0;i<edge.size();i++){
            
            int next=edge.get(i);
            
            if(nodes[next].visited){
                continue;
            }
            
            nodes[next].visited=true;
            dfs(next);
            
            tempSumR+=nodes[next].sumChildR;
            tempSumB+=nodes[next].sumChildB;
            
            
            if(!((nodes[next].sumChildB>0 && nodes[next].sumChildR>0) || (totalRed-nodes[next].sumChildR>0 && totalBlue-nodes[next].sumChildB>0) )){
                ans++;
            }
            
        }
        
       nodes[root].sumChildB=tempSumB;
       nodes[root].sumChildR=tempSumR;
        
    }
}