#include <bits/stdc++.h>
using namespace std;

void dfs(int node, vector<vector<int>> adj, int used[], int parent[], vector<int> &dp, vector<int> &d, int val[]) {
	used[node] = 1;
	for (auto v: adj[node]) {
		if (!used[v]) {
			parent[v] = node;
			d[v] = d[node] + 1;
			dfs(v, adj, used, parent, dp, d, val);
		}
	}
	
	dp[node] = val[node] ^ d[node];
	int sum = 0;
	
	for (auto v: adj[node]) {
		if (v != parent[node]) {
		    sum += dp[v];
		}
	}
	
	dp[node] += sum;
}

int main() {
	int n;
	cin >> n;
	
	vector<vector<int>> adj(n+1);
	int val[n+1];
	
	for (int i = 1; i <= n; i++) {
		cin >> val[i];
	}
	
	for (int i = 0; i < n-1; i++) {
		int u, v;
		cin >> u >> v;
		
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	
	int used[n+1] = {0};
	int parent[n+1]= {0};
	vector<int> dp(n+1, 0);
	vector<int> d(n+1, 0);
	d[1] = 0;
	
	dfs(1, adj, used, parent, dp, d, val);
	
	for (int i = 1; i <= n; i++) {
		cout << d[i] << " " << dp[i] << "\n";
	}
	
	//cout << dp[n] << "\n";
	return 0;
}