Language: C++

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long
#define itn int
#define endl '\n'
#define co(ans) cout<<ans<<endl
#define COYE cout<<"YES"<<endl
#define COYe cout<<"Yes"<<endl
#define COye cout<<"yes"<<endl
#define CONO cout<<"NO"<<endl
#define CONo cout<<"No"<<endl
#define COno cout<<"no"<<endl
#define FORE(i,a) for(auto &i:a)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n)  FFOR(i,1,n)
#define PB push_back
#define MP make_pair
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort((V).begin(),(V).end())
#define REVERSE(V) reverse((V).begin(),(V).end())
#define EACH(V,i) for(typeof((V).begin()) i=(V).begin();i!=(V).end();++i)
#define equals(a,b) (fabs((a)-(b))<EPS)
#define INF ((1LL<<62)-(1LL<<31))
#define EPS 1e-10
#define PI 3.141592653589793238
#define MOD 1000000007
#define MAX 5100000
using namespace std;
using Edge=pair<int,int>;
using Graph=vector<vector<E>>;
inline int toInt(string s){int v;istringstream sin(s);sin>>v;return v;}
template<class T>inline string toString(T x){ostringstream sout;sout<<x;return sout.str();}
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(b<a){a=b;return 1;}return 0;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
const int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

int N;
Graph G;
vector<int> res;

// vをcに塗る。pはvの親
void dfs(int v,int p,int c) {
  res[v]=c;
  for(auto e:G[v]) {
    if(e.first==p) continue;
    if(e.second & 1) dfs(e.first,v,1-c);
    else dfs(e.first,v,c);
  }
}

int main(){
  cin>>N;
  G.assign(N,vector<Edge>());
  for(int i=0; i<N-1; ++i){
    int u,v,w;
    cin>>u>>v>>w;
    --u,--v;
    G[u].push_back(Edge(v, w));
    G[v].push_back(Edge(u, w));
  }
  res.assign(N, 0);
  dfs(0,-1,1);
  for(auto v:res) cout<<v<<endl;
  return 0;
}

Compiler output:
a.cc:56:27: error: 'E' was not declared in this scope
   56 | using Graph=vector<vector<E>>;
      |                           ^
a.cc:56:27: error: template argument 1 is invalid
a.cc:56:27: error: template argument 2 is invalid
a.cc:56:28: error: template argument 1 is invalid
   56 | using Graph=vector<vector<E>>;
      |                            ^~
a.cc:56:28: error: template argument 2 is invalid
a.cc:71:1: error: 'Graph' does not name a type
   71 | Graph G;
      | ^~~~~
a.cc: In function 'void dfs(int, int, int)':
a.cc:77:14: error: 'G' was not declared in this scope
   77 |   for(auto e:G[v]) {
      |              ^
a.cc: In function 'int main()':
a.cc:86:3: error: 'G' was not declared in this scope
   86 |   G.assign(N,vector<Edge>());
      |   ^