Problem:
Score : 400 points

Problem Statement

We have a tree with N vertices numbered 1 to N.
The i-th edge in the tree connects Vertex u_i and Vertex v_i, and its length is w_i.
Your objective is to paint each vertex in the tree white or black (it is fine to paint all vertices the same color) so that the following condition is satisfied:

For any two vertices painted in the same color, the distance between them is an even number.

Find a coloring of the vertices that satisfies the condition and print it. It can be proved that at least one such coloring exists under the constraints of this problem.

Constraints

All values in input are integers.

1 \leq N \leq 10^5

1 \leq u_i < v_i \leq N

1 \leq w_i \leq 10^9

Input

Input is given from Standard Input in the following format:

N
u_1 v_1 w_1
u_2 v_2 w_2
.
.
.
u_{N - 1} v_{N - 1} w_{N - 1}

Output

Print a coloring of the vertices that satisfies the condition, in N lines.
The i-th line should contain 0 if Vertex i is painted white and 1 if it is painted black.

If there are multiple colorings that satisfy the condition, any of them will be accepted.

Sample Input 1

3
1 2 2
2 3 1

Sample Output 1

0
0
1

Sample Input 2

5
2 5 2
2 3 10
1 3 8
3 4 2

Sample Output 2

1
0
1
0
1

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.io.IOException;
import java.io.InputStream;
import java.util.*;


public class Main {
	
    public static void main(String[] args) {
    	FastScanner sc = new FastScanner();
 
    	int n = sc.nextInt();
    	WGraph g = new WGraph(n);
    	
    	for(int i=0;i<n-1;i++){
    		g.addEdge(sc.nextInt()-1,sc.nextInt()-1,sc.nextInt()%2);
    	}
    	
    	boolean[] ans = g.ans();
    	
    	for(int i=0;i<n;i++){
    		if(ans[i]){
        		System.out.println(1);
    		}
    		else{
        		System.out.println(0);
    		}
    	}

    }
    
    
    
}

class WGraph {
	WEdgeList[] elist;
	static int[] g;
	
	public WGraph(int vnum){
		this.elist = new WEdgeList[vnum];
		for(int i=0;i<vnum;i++){
			elist[i] = new WEdgeList();
		}
	}

	//同じ辺を複数回追加すると多重辺が生まれてしまう
	public void addEdge(int a, int b, int w){
		elist[a].add(new WEdge(b,w));
		elist[b].add(new WEdge(a,w));
	}
	
	//頂点数を返す
	int vnum(){
		return elist.length;
	}
	
	//辺数を返す
	int edgeNum(){
		int sum = 0;
		for(WEdgeList l:elist){
			sum += l.size();
		}
		return sum/2;
	}
	
	//隣接判定
	boolean isNext(int n, int m){
		return elist[n].contains(m);
	}
	
	//隣接する全ての頂点を返す
	ArrayList<Integer> nextList(int n){
		ArrayList<Integer> l = new ArrayList<>();
		for(WEdge e:elist[n]){
			l.add(e.to);
		}
		return l;
	}
	
	//隣接する全ての辺を返す
	WEdgeList EList(int n){
		return elist[n];
	}
	
	//ダイクストラ法でsからgまでの最短距離を求める。到達不可は-1。
	class NodeD implements Comparable<NodeD>{
		int n;
		
		public NodeD(int n){
			this.n = n;
		}
		
		@Override
		public int compareTo(NodeD o){
			return Integer.compare(g[n], g[o.n]);
		}

		private WGraph getOuterType() {
			return WGraph.this;
		}
		
		@Override
		public int hashCode() {
			final int prime = 31;
			int result = 1;
			result = prime * result + getOuterType().hashCode();
			result = prime * result + n;
			return result;
		}

		@Override
		public boolean equals(Object obj) {
			if (this == obj)
				return true;
			if (obj == null)
				return false;
			if (getClass() != obj.getClass())
				return false;
			NodeD other = (NodeD) obj;
			if (!getOuterType().equals(other.getOuterType()))
				return false;
			if (n != other.n)
				return false;
			return true;
		}
	}
	int Dijkstra(int start, int goal){
		
		PriorityQueue<NodeD> frontier = new PriorityQueue<>();
		g = new int[vnum()];
		Arrays.fill(g, -1);
		boolean[] isExplored = new boolean[vnum()];
		
		frontier.add(new NodeD(start));
		g[start] = 0;
		
		
		while(!frontier.isEmpty()){
			NodeD now = frontier.poll();
			if(now.n == goal){
				return g[now.n];
			}
			isExplored[now.n] = true;
			
			for(WEdge e:EList(now.n)){
				if(isExplored[e.to]){
					continue;
				}
				
				NodeD next = new NodeD(e.to);
				if(g[next.n] != -1){
					if(g[next.n] <= g[now.n] + e.w){
						continue;
					}
					else{
						frontier.remove(next);
					}
				}
				
				g[next.n] = g[now.n] + e.w;
				frontier.add(next);
			}	
		}
		
		return -1;
	}
	
	//ダイクストラ法でsからの最短距離列を求める。到達不可は-1。
	int[] DijkstraArray(int start){
		PriorityQueue<NodeD> frontier = new PriorityQueue<>();
		g = new int[vnum()];
		Arrays.fill(g, -1);
		boolean[] isExplored = new boolean[vnum()];
		
		frontier.add(new NodeD(start));
		g[start] = 0;
		
		
		while(!frontier.isEmpty()){
			NodeD now = frontier.poll();
			isExplored[now.n] = true;
			
			for(WEdge e:EList(now.n)){
				if(isExplored[e.to]){
					continue;
				}
				
				NodeD next = new NodeD(e.to);
				if(g[next.n] != -1){
					if(g[next.n] <= g[now.n] + e.w){
						continue;
					}
					else{
						frontier.remove(next);
					}
				}
				
				g[next.n] = g[now.n] + e.w;
				frontier.add(next);
			}	
		}
		
		return g;
	}
	
	boolean[] ans(){
		boolean [] isB = new boolean[vnum()];
		
		isB[0] = true;
		
		int[] d = DijkstraArray(0);
		
		for(int i=1;i<vnum();i++){
			if(d[i]%2 == 0){
				isB[i] = true;
			}
			else{
				isB[i] = false;
			}
		}
		
		return isB;
		
	}
	
	class WEdgeList extends ArrayList<WEdge>{
		private static final long serialVersionUID = 4901656039324433445L;
	}
	class WEdge{
		int to;
		int w;
		
		public WEdge(int to, int w){
			this.to = to;
			this.w = w;
		}
	}
}

 
class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    public double nextDouble() { return Double.parseDouble(next());}
}