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:
import java.io.*;
import java.util.*;
public class gg{ 
        
        static boolean visited[];
        static LinkedList<Integer> adjList[];
        static long a[] ;
        static int dist[] ;
        static long sum[];
        static long max=0;
      static void addEdge(int s,int d){
                             adjList[s].add(d);
                             adjList[d].add(s);
                          }
      static void DFS(int s,int l){
                          visited[s]=true;
                         for(Integer I : adjList[s])
                             if(visited[I]==false){
                                  dist[I]=l+1;
                                  DFS(I,l+1);                               
                                  sum[s]=sum[s]+sum[I];
                             }
                    }  
       static void DFS_Propagate(int s,long ans){
                                 visited[s]=true;
                           for(Integer I: adjList[s])
                                   if(visited[I]==false){
                                       long res = ans-sum[I]+(sum[0]-sum[I]);
                                       max=Math.max(max,res);
                                       DFS_Propagate(I,res);
                             }
                    }
      static void solve(){
                           DFS(0,0);
                           long ans=0;
                          for(int i=0;i<sum.length;i++)
                               ans=ans+a[i]*dist[i];
                               Arrays.fill(visited,false);
                               max=ans;
                            DFS_Propagate(0,ans);
                }
      public static void main(String[] args){ 
                   PrintWriter out = new PrintWriter(System.out);
                    int n = intt();
                    adjList = new LinkedList[n];
                    visited = new boolean[n];
                    sum = new long[n];
                    dist = new int[n];
                    a = new long[n];

                       for(int i=0;i<n;i++)
                           adjList[i] = new LinkedList();
                       for(int i=0;i<n;i++)
                           { a[i] = sc.nextLong(); sum[i]=a[i];}
                       for(int i=1;i<n;i++){
                            int x = intt()-1;
                            int y= intt()-1;
                             addEdge(x,y);
                       }  
                   solve();
                   System.out.println(max); 
      
    } 

                static FastReader sc=new FastReader();
                static PrintWriter out = new PrintWriter(System.out);
                static int mod=1000000007;

             static int intt(){
                       int x = sc.nextInt();
                       return(x);
                }
               static long longg(){
                          long x = sc.nextLong();
                           return(x);
                }
               static double doublee(){
                          double t = sc.nextDouble();
                           return(t);
                }
              static String str(){
                       String s = sc.next();
                         return(s);
                }
              static String strln(){
                        String s = sc.nextLine();
                           return(s);
              }
              static long pow(long a,long b){
                       long ans=1;
                      while(b>0){
                          if(b%2==1)
                              ans=(ans*a);
                              a=(a*a)%mod;
                              b=b/2;
                      }
                    return(ans);
                }
             static long GCD(long a,long b){
                           if(b%a==0)
                               return(a);
                               return(GCD(b%a,a));
              }
            static long LCM(long a,long b){
                         return ((a*b)/GCD(a,b));
               }
              static long Fermat(long a,long p){
                           long b = p-2,ans=1;
                            while(b>0){
                                 if(b%2==1)
                                      ans=(ans*a)%p;
                                       a=(a*a)%p;
                                       b=b/2;
                              }
                           return(ans);
                   }
              static void Fact(long a[],long m){
                              a[0]=1;
                           for(int i=1;i<a.length;i++)
                                   a[i]=(i*a[i-1])%m;

                      }
              static void Fact_Inv(long a[],long F[],long m){

                                 int n =a.length;
                                     a[n-1]=Fermat(F[n-1],m);
                                 for(int i=n-2;i>=0;i--)
                                        a[i]=((i+1)*a[i+1])%m;
                        }
                  static int abs(char x,char y)
                   { return(Math.abs(x-y));}
        static int min(int x,int y){
                     return(Math.min(x,y));
                 }
        static int max(int a,int b){
                        return Math.max(a,b);
                  }    
         static boolean correct(int n){
                          if((n&(n+1))==0)
                              return(true);
                              return(false);
                  }

         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; 
        } 
    } 
}