#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,K;
vector<int> E[101010];
int A[101010];

ll dp[202020][40];

void dfs(int cur,int pre) {
	dp[cur][0]^=A[cur];
	FORR(e,E[cur]) if(e!=pre) {
		dfs(e,cur);
		int i;
		FOR(i,2*K) dp[cur][(i+1)%(2*K)]^=dp[e][i];
	}
}

void dfs2(int cur,int pre,vector<int> V) {
	int i;
	FOR(i,2*K) dp[cur][(i+1)%(2*K)]^=V[i];
	FORR(e,E[cur]) if(e!=pre) {
		FOR(i,2*K) V[i]=dp[cur][i]^dp[e][(i+2*K-1)%(2*K)];
		dfs2(e,cur,V);
	}
	
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>K;
	FOR(i,N-1) {
		cin>>x>>y;
		E[x-1].push_back(y-1);
		E[y-1].push_back(x-1);
	}
	FOR(i,N) cin>>A[i];
	dfs(0,0);
	vector<int> V(2*K);
	dfs2(0,0,V);
	
	FOR(i,N) {
		int nim=0;
		FOR(j,K) nim^=dp[i][j+K];
		cout<<(nim>0)<<" ";
	}
	cout<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}
