Problem: You are given a tree consisting of n vertices. A tree is a connected undirected graph with n-1 edges. Each vertex v of this tree has a color assigned to it (a_v = 1 if the vertex v is white and 0 if the vertex v is black).

You have to solve the following problem for each vertex v: what is the maximum difference between the number of white and the number of black vertices you can obtain if you choose some subtree of the given tree that contains the vertex v? The subtree of the tree is the connected subgraph of the given tree. More formally, if you choose the subtree that contains cnt_w white vertices and cnt_b black vertices, you have to maximize cnt_w - cnt_b.

Input

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

The second line of the input contains n integers a_1, a_2, ..., a_n (0 ≤ a_i ≤ 1), where a_i is the color of the i-th vertex.

Each of the next n-1 lines describes an edge of the tree. Edge i is denoted by two integers u_i and v_i, the labels of vertices it connects (1 ≤ u_i, v_i ≤ n, u_i ≠ v_i).

It is guaranteed that the given edges form a tree.

Output

Print n integers res_1, res_2, ..., res_n, where res_i is the maximum possible difference between the number of white and black vertices in some subtree that contains the vertex i.

Examples

Input


9
0 1 1 1 0 0 0 0 1
1 2
1 3
3 4
3 5
2 6
4 7
6 8
5 9


Output


2 2 2 2 2 1 1 0 2 


Input


4
0 0 1 0
1 2
1 3
1 4


Output


0 -1 1 -1 

Note

The first example is shown below:

<image>

The black vertices have bold borders.

In the second example, the best subtree for vertices 2, 3 and 4 are vertices 2, 3 and 4 correspondingly. And the best subtree for the vertex 1 is the subtree consisting of vertices 1 and 3.

Solution (in JAVA):

Solution:
/* Here parVal denotes maxValue of parent of a node when this node was not included . subVal denotes the maximum value obtained in its
subtree . total value = parVal+subVal

                (1)
              / \   \
             /   \   \
            (2)  (3) (4)

for node 2 parVal denotes maximum value in subtree 1 in which its child 2 is not included.
           subVal deontes maximum value in subtree 2 
    total value = parVal + subVal;
*/
import java.util.*;
import java.io.*;
public class lp1{ 
static PrintWriter out = new PrintWriter(System.out);
static int[] a,subVal,parVal,val;
static LinkedList<Integer> l[];
static void dfs(int s,int p)
{
      int v = (val[s] == 1 ? 1 : -1);
      for(Integer I : l[s]) 
          {
		if(I == p) continue;
		  dfs(I, s);
		v += Math.max(0, subVal[I]);
          }
		subVal[s] = v;
}
static void dfs2(int s, int p) 
{
		if(p == -1) {
			parVal[s] = 0;
		}
		else {
			int v = parVal[p] + subVal[p];
			if(subVal[s] >= 0) v -= subVal[s];
			parVal[s] = Math.max(0,v);
		}
		for(Integer I : l[s]) if(I != p) dfs2(I,s);
}
public static void main(String[] args){

int n = ni();
val = new int[n];
l = new LinkedList[n];
subVal = new int[n];
parVal = new int[n];
for(int i=0;i<n;i++)
{
    val[i] = ni();
    l[i] = new LinkedList();
}

for(int i=1;i<n;i++){
   int u = ni()-1;
   int v = ni()-1;
   l[u].add(v);
   l[v].add(u);
}

		dfs(0, -1);
		dfs2(0,-1);

for(int i = 0; i < n; i++) 
	p((subVal[i]+parVal[i])+" ");
   out.flush();
} 
static int BIT[];
static void add(int index,int val)
{
       while(index<BIT.length)
           {
                BIT[index] = BIT[index]+val;
                index = index + (index&(-index));
           }
}
static int get_sum(int index)
{
       int sum=0;
       while(index>0)
         {
              sum = sum+BIT[index];
              index = index- (index&(-index));
         }
      return sum;
}
static void dfs(LinkedList<Integer> l[],int s,int p)
{
         for(Integer I : l[s])
             if(I!=p)
              dfs(l,I,s);
}
static int[] ai(int n)  // it will give in array of size n
{
    int a[] = new int[n];
    for(int i=0;i<n;i++)
        a[i] = ni();
    return a;
}
static long[] al(int n)  // it will give in array of size n
{
    long a[] = new long[n];
    for(int i=0;i<n;i++)
        a[i] = nl();
    return a;
}

static void p(Object o)
{
   out.print(o);
}
static void pn(Object o)
{
    out.println(o);
}
static int abs(int x)
{
    return x>0 ? x : -x;
}
static long gcd(long a,long b)
{
       if(b%a==0)
          return a;
          return gcd(b%a,a);
}
static void subtract_1(char s[]) // it will subtract 1 from the given number.  number should be positive
{
      if(s[0]=='0') // number is zero
          return;
     int n = s.length,i=n-1;
     while(s[i]=='0')
       i--;
     s[i] = (char)((int)(s[i]-'0') + 47);
   
     for(int j=i+1;j<n;j++)
         s[j]='9';
}
static long pow(long a,long b,long md)
{ 
    long ans=1;
    while(b>0)
    {
         if(b%2==1)
           ans = (ans*a)%md;
           a = (a*a)%md;
           b = b/2;
    }
   return ans;
}
static long min(long a,long b){
 
     return a<b ? a : b;
}
static long max(long a,long b){
     return a>b ? a : b;
}
static boolean pal(String s)
{
   int n = s.length(),i1=0,i2=n-1;
 
     while(i1<i2)
     {
        if(s.charAt(i1)!=s.charAt(i2))
             return false;
             i1++; i2--;
     }
       return true;
}
static String rev(String r)
{
    String s = "";
    int i= r.length()-1;
 
    while(i>=0)
    {
        s=s+r.charAt(i);
        i--;   
    }
       return s;
}
static FastReader sc=new FastReader(); 
 
      static int ni(){
                 int x = sc.nextInt();
                 return(x);
        }
      static long nl(){
              long x = sc.nextLong();
              return(x);
         }
      static String n(){
                 String str = sc.next();
                     return(str);
       }
     static String ns(){
                 String str = sc.nextLine();
                   return(str);
      }
     static double nd(){
               double d = sc.nextDouble();
                 return(d);
       }
  static class FastReader 
    { 
        BufferedReader br; 
        StringTokenizer st; 
  
        public FastReader() 
        { 
            br = new BufferedReader(new
                     InputStreamReader(System.in)); 
        } 
  
        String next() 
        { 
            while (st == null || !st.hasMoreElements()) 
            { 
                try
                { 
                    st = new StringTokenizer(br.readLine()); 
                } 
                catch (IOException  e) 
                { 
                    e.printStackTrace(); 
                } 
            } 
            return st.nextToken(); 
        } 
  
        int nextInt() 
        { 
            return Integer.parseInt(next()); 
        } 
  
        long nextLong() 
        { 
            return Long.parseLong(next()); 
        } 
  
        double nextDouble() 
        { 
            return Double.parseDouble(next()); 
        } 
  
        String nextLine() 
        { 
            String str = ""; 
            try
            { 
                str = br.readLine(); 
            } 
            catch (IOException e) 
            { 
                e.printStackTrace(); 
            } 
            return str; 
        } 
    } 
}