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:
// created on : Thu Jul 23 2020
 
import java.io.*;
import java.util.*;

public class F627D3 {

    public static void main(String[] args) throws IOException {
        Solution s = new Solution();
        s.solve();
        s.close();
    }
}

class Solution {
	List<Integer>[] adj;
	int[] a, ans, dp;

	// dp[i]: max difference if we only had to consider the subtree rooted at node i
	void dfs1(int u, int p){
		dp[u] = a[u];
		for(int v: adj[u]){
			if(v == p){
				continue;
			}
			dfs1(v, u);
			dp[u] += Math.max(dp[v], 0);
		}
	}

	// shift root to each node to find its max difference 
	void dfs2(int u, int p){
		ans[u] = dp[u];
		for(int v: adj[u]){
			if(v == p){
				continue;
			}
			// remove value from parent and update value for child node
			dp[u] -= Math.max(dp[v], 0);
			dp[v] += Math.max(dp[u], 0);
			dfs2(v, u);

			// restore the values
			dp[v] -= Math.max(dp[u], 0);
			dp[u] += Math.max(dp[v], 0);
		}
	}

	void solve() throws IOException {
		int n = in.nextInt();
		a = new int[n];
		for(int i = 0; i < n; i++){
			a[i] = in.nextInt() == 1 ? 1 : -1; 
		}

		adj = new ArrayList[n];
		for(int i = 0; i < n; i++){
			adj[i] = new ArrayList<>();
		}

		for(int i = 0; i < n - 1; i++){
			int u = in.nextInt() - 1;
			int v = in.nextInt() - 1;
			adj[u].add(v);
			adj[v].add(u);
		}

		ans = new int[n];
		dp = new int[n];

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

		println(ans);
	}

	static final int MIN = Integer.MIN_VALUE;
	static final int MAX = Integer.MAX_VALUE;
	static final Reader in = new Reader();
	static final PrintWriter out = new PrintWriter(System.out);

	int[] readInt(int N) throws IOException { 
		int[] arr = new int[N];
		for(int i = 0; i < N; i++){ 
			arr[i] = in.nextInt(); 
		} 
		return arr;
	}

	long[] readLong(int N) throws IOException { 
		long[] arr = new long[N];
		for(int i = 0; i < N; i++){ 
			arr[i] = in.nextLong(); 
		} 
		return arr;
	}

	void print(Object O) {  
		out.print(O); 
	}

	void println(Object O) { 
		out.println(O); 
	}

	void println(int[] arr) { 
		for(int i = 0; i < arr.length; i++){ 
			print(arr[i] + " "); 
		} 
		println(""); 
	}

	void displayRuntime(long startTime){
	    long stopTime = System.currentTimeMillis();
	    long elapsedTime = stopTime - startTime;
	    System.out.printf("Runtime: %.2f /n", elapsedTime / 1000D);
	}

	void close() throws IOException{
		in.close();
		out.close();
	}
}

class Reader {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");

    String next() throws IOException {
        while (!st.hasMoreTokens() ) { 
            st = new StringTokenizer(br.readLine()); 
        }
        return st.nextToken();
    }

    int nextInt() throws IOException { 
        return Integer.parseInt(next()); 
    }
    
    long nextLong() throws IOException { 
        return Long.parseLong(next()); 
    }

    double nextDouble() throws IOException { 
        return Double.parseDouble(next());
    }
    
    String nextLine() throws IOException { 
        return br.readLine(); 
    }
    
    void close() throws IOException { 
        br.close(); 
    }
}