#include <iostream>
#include <cstdint>
#include <vector>
#include <unordered_set>
#include <queue>
#include <tuple>
#include <map>

using namespace std;

template <typename N = std::size_t, typename E = std::size_t>
class SparseGraph
{
public:
    using NodeType = N;
    using EdgeType = E;
    using NeighborListType = std::unordered_set<std::size_t>;

    SparseGraph(bool undirected = true) noexcept
        : undirected_(undirected)
    {
    }

    void push_node(NodeType n) noexcept
    {
        nodes_.push_back(n);
        neighbor_list_.emplace_back();
    }

    void connect(const std::size_t from, const std::size_t to, const EdgeType edge = EdgeType()) noexcept
    {
        if (undirected_)
        {
            neighbor_list_[from].insert(to);
            neighbor_list_[to].insert(from);
            edges_[std::make_pair(std::min(from, to), std::max(from, to))] = edge;
        }
        else
        {
            neighbor_list_[from].insert(to);
            edges_[std::make_pair(from, to)] = edge;
        }
    }

    void disconnect(const std::size_t from, const std::size_t to) noexcept
    {
        if (undirected_)
        {
            neighbor_list_[from].erase(to);
            neighbor_list_[to].erase(from);
            edges_.erase(std::make_pair(std::min(from, to), std::max(from, to)));
        }
        else
        {
            neighbor_list_[from].erase(to);
            edges_.erase(std::make_pair(from, to));
        }
    }

    const NodeType &node(const std::size_t index) const noexcept
    {
        return nodes_.at(index);
    }

    const EdgeType &edge(const std::size_t from, const std::size_t to) const noexcept
    {
        if (undirected_)
        {
            auto key = std::make_pair(std::min(from, to), std::max(from, to));
            return edges_.at(key);
        }
        else
        {
            auto key = std::make_pair(from, to);
            return edges_.at(key);
        }
    }

    NodeType &node(const std::size_t index) noexcept
    {
        return nodes_.at(index);
    }

    EdgeType &edge(const std::size_t from, const std::size_t to) noexcept
    {
        if (undirected_)
        {
            auto key = std::make_pair(std::min(from, to), std::max(from, to));
            return edges_.at(key);
        }
        else
        {
            auto key = std::make_pair(from, to);
            return edges_.at(key);
        }
    }

    const NeighborListType &
    neighbor(const std::size_t index) const noexcept
    {
        return neighbor_list_[index];
    }

    std::size_t size() const noexcept
    {
        return neighbor_list_.size();
    }

private:
    using EdgeMap = std::map<std::pair<std::size_t, std::size_t>, EdgeType>;

    std::vector<NeighborListType> neighbor_list_;

    EdgeMap edges_;

    std::vector<NodeType> nodes_;

    bool undirected_;
};

int main()
{
    int n;
    cin >> n;

    SparseGraph<> graph;
    for (int i = 0; i < n; i++)
    {
        graph.push_node(0);
    }

    for (int i = 0; i < n - 1; i++)
    {
        int64_t f, t, w;
        cin >> f >> t >> w;
        graph.connect(f - 1, t - 1, w % 2);
    }

    queue<pair<int, int>> que;
    for (auto v : graph.neighbor(0))
    {
        que.emplace(v, 0);
    }

    while (!que.empty())
    {
        int v, p;
        tie(v, p) = que.front();
        que.pop();
        auto edge = graph.edge(v, p);
        graph.node(v) = (graph.node(p) + edge) % 2;
        for (auto nv : graph.neighbor(v))
        {
            if (nv != p)
            {
                que.emplace(nv, v);
            }
        }
    }
    for (int i = 0; i < n; i++)
    {
        cout << graph.node(i) << endl;
    }
}

Measured memory_bytes: 24236