stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

#define ll long long

vector<int>q[200000];

int color[200000];

int flag[200000];

int n,m;

int v[200000],d[200000],c[200000];

void dfs(int x,int cnt,int c)

{

   if(!color[x])

       color[x]=c;

   if(flag[x]>=cnt)

       return;

   if(cnt==0)

       return;

   flag[x]=cnt;

   for(int i=0;i<q[x].size();i++)

       dfs(q[x][i],cnt-1,c);

}

int main()

{

    cin>>n>>m;

    for(int i=1;i<=m;i++)

    {

        int x,y;

        cin>>x>>y;

        q[x].push_back(y);

        q[y].push_back(x);

    }

    int q;

    cin>>q;

    for(int i=1;i<=q;i++)

       cin>>v[i]>>d[i]>>c[i];

    for(int i=q;i>=1;i--)

        dfs(v[i],d[i],c[i]);

    for(int i=1;i<=n;i++)

        cout<<color[i]<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 4.603057789923113x):
#include<cstdio>

#include<iostream>

#include<queue>

#include<cstring>

#define N 100010

using namespace std;

struct Dis{

	int x,z;

};

queue<Dis>Q;

int a[N],c[N],d[N],e[N],f[N],num,h[N],n,m,p,q,t,col;

bool bo[N];

struct Edge{

	int p,q,n;

}b[N*2];

void ljb(int p,int q){

	b[++num].n=h[p];

	h[p]=num;

	b[num].p=p;

	b[num].q=q;

}

void Bfs(){

	int x,y,z;

	while(!Q.empty()){

		x=Q.front().x; z=Q.front().z; Q.pop(); 

//		printf("%d %d\n",x,z);

		if(!f[x])f[x]=col;

		e[x]=max(e[x],z);

		if(z==0)continue;

		for(int i=h[x];i!=0;i=b[i].n){

			y=b[i].q;

			if(e[y]<z-1)Q.push((Dis){y,z-1});

		}

	}

}

int main(){

	memset(e,-1,sizeof(e));

	scanf("%d%d",&n,&m);

	for(int i=1;i<=m;i++){

		scanf("%d%d",&p,&q);

		ljb(p,q);

		ljb(q,p);

	}

	scanf("%d",&t);

	for(int i=1;i<=t;i++)scanf("%d%d%d",&a[i],&d[i],&c[i]);

	for(int i=t;i>=1;i--){

		if(e[a[i]]>=d[i])continue;

		col=c[i];

		Q.push((Dis){a[i],d[i]});

		Bfs();

	}

//	for(int i=1;i<=n;i++)printf("%d %d\n",i,e[i]);

	for(int i=1;i<=n;i++)printf("%d\n",f[i]);

}
// Slower C++ solution:
#include<cstdio>

#include<algorithm>

#include<cstring>

#define maxn 200050

#define add(u,v) (to[++top]=head[u],head[u]=top,w[top]=v)

#define For(x) for(int h=head[x],o=w[h];h;o=w[h=to[h]])

using namespace std;

int n,m,to[maxn],head[maxn],w[maxn],u,v,top;

int a[maxn],b[maxn],c[maxn],co[maxn],r[maxn],q,i;

void dfs(int x,int rg,int col)

{

	if (rg<=r[x]||rg<=0) return;

	r[x]=rg; 

	if (co[x]==0) co[x]=col;

	For(x) dfs(o,rg-1,col);

}

int main()

{

	scanf("%d%d",&n,&m);

	while (m--)

	{

		scanf("%d%d",&u,&v);

		add(u,v); add(v,u);

    }

    scanf("%d",&q);

    for (i=1;i<=q;i++) scanf("%d%d%d",&a[i],&b[i],&c[i]);

    memset(co,0,sizeof(co)); memset(r,0,sizeof(r));

    for (i=q;i>=1;i--) dfs(a[i],b[i]+1,c[i]);

    for (i=1;i<=n;i++) printf("%d\n",co[i]);

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.2766498863098694x):
#include<cstdio>

#include<iostream>

#include<queue>

#include<cstring>

#define N 100010

using namespace std;

struct Dis{

	int x,z;

};

queue<Dis>Q;

int a[N],c[N],d[N],e[N],f[N],num,h[N],n,m,p,q,t,col;

bool bo[N];

struct Edge{

	int p,q,n;

}b[N*2];

void ljb(int p,int q){

	b[++num].n=h[p];

	h[p]=num;

	b[num].p=p;

	b[num].q=q;

}

void Bfs(){

	int x,y,z;

	while(!Q.empty()){

		x=Q.front().x; z=Q.front().z; Q.pop(); 

//		printf("%d %d\n",x,z);

		if(!f[x])f[x]=col;

		e[x]=max(e[x],z);

		if(z==0)continue;

		for(int i=h[x];i!=0;i=b[i].n){

			y=b[i].q;

			if(e[y]<z-1)Q.push((Dis){y,z-1});

		}

	}

}

int main(){

	memset(e,-1,sizeof(e));

	scanf("%d%d",&n,&m);

	for(int i=1;i<=m;i++){

		scanf("%d%d",&p,&q);

		ljb(p,q);

		ljb(q,p);

	}

	scanf("%d",&t);

	for(int i=1;i<=t;i++)scanf("%d%d%d",&a[i],&d[i],&c[i]);

	for(int i=t;i>=1;i--){

		if(e[a[i]]>=d[i])continue;

		col=c[i];

		Q.push((Dis){a[i],d[i]});

		Bfs();

	}

//	for(int i=1;i<=n;i++)printf("%d %d\n",i,e[i]);

	for(int i=1;i<=n;i++)printf("%d\n",f[i]);

}
// Slower C++ solution:
#include <cstdio>

#include <memory.h>

#include <vector>

using namespace std;

const int maxn = 200005;

struct Query{

    int v, d, c;

}q[maxn];

int n, m, Q;

vector<int> G[maxn];

bool vis[maxn][15];

int color[maxn];



void solve(int v, int d, int c){

    if(vis[v][d]) return;

    if(color[v] == 0)    color[v] = c;

    if(d <= 0) return;



    for(int i = 0; i < G[v].size(); i++)

    {

        solve(G[v][i], d-1, c);

    }

    vis[v][d] = 1;



}

int main(){

//freopen("input.txt", "r", stdin);

    scanf("%d %d", &n, &m);

    memset(color, 0, sizeof(color));

    memset(vis, false, sizeof(vis));

    int a, b;

    for(int i = 0; i < m; i++)

    {

        scanf("%d %d", &a, &b);

        G[a].push_back(b);

        G[b].push_back(a);

    }

    scanf("%d", &Q);

    for(int i = 0; i < Q; i++)

    {

        scanf("%d %d %d", &q[i].v, &q[i].d, &q[i].c);

    }

    for(int i = Q-1; i >= 0; i--)

       solve(q[i].v, q[i].d, q[i].c);

    for(int i = 1; i <= n; i++)

        printf("%d\n", color[i]);

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 2.7073783873400625x):
#define _CRT_SECURE_NO_WARNINGS

#include <iostream>

#include <sstream>

#include <iomanip>

#include <cstdio>

#include <cstdlib>

#include <cmath>

#include <cctype>

#include <cstring>

#include <vector>

#include <list>

#include <queue>

#include <deque>

#include <stack>

#include <map>

#include <set>

#include <algorithm>

#include <iterator>

#include <bitset>

#include <ctime>

#include<complex>

using namespace std;



#define FOR(i,a,b) for (int i = (a); i < (b); i++)

#define RFOR(i,b,a) for (int i = (b)-1; i >= (a); i--)

#define ITER(it,a) for (__typeof(a.begin()) it = a.begin(); it != a.end(); it++)

#define FILL(a,value) memset(a, value, sizeof(a))



#define SZ(a) (int)a.size()

#define ALL(a) a.begin(), a.end()

#define PB push_back

#define MP make_pair



typedef long long LL;

typedef vector<int> VI;

typedef pair<int, int> PII;



const double PI = acos(-1.0);

const int INF = 1000 * 1000 * 1000 + 7;

const LL LINF = INF * (LL)INF;



const int MAX = 1000 * 100 + 47;



struct Item

{

	int v, d, c;

};



Item Q[MAX];

vector<int> g[MAX];

int U[MAX];

int D[MAX];

int C[MAX];

int iter;



void dfs(int v, int d, int curD, int color)

{

	if (d > curD) return;

	if (curD - d <= D[v]) return;

	D[v] = curD - d;

	if (C[v] == 0) C[v] = color;

	FOR(i, 0, SZ(g[v]))

	{

		int to = g[v][i];

		dfs(to, d + 1, curD, color);

	}

}



int main()

{

	//freopen("in.txt", "r", stdin);

	//freopen("out.txt", "w", stdout);

	//ios::sync_with_stdio(false); cin.tie(0);

	int n, m;

	cin >> n >> m;

	FOR(i, 0, m)

	{

		int a, b;

		cin >> a >> b;

		a--;

		b--;

		g[a].push_back(b);

		g[b].push_back(a);

	}



	int q;

	cin >> q;

	FOR(i, 0, q)

	{

		cin >> Q[i].v >> Q[i].d >> Q[i].c;

		Q[i].v--;

	}



	reverse(Q, Q + q);

	FILL(D, -1);

	FOR(i, 0, q)

	{

		dfs(Q[i].v, 0, Q[i].d, Q[i].c);

	}



	FOR(i, 0, n)

	{

		//cout << i + 1 << ": " << C[i] << "\n";

		cout << C[i] << "\n";



	}

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

#define ll long long

vector<int>q[200000];

int color[200000];

int flag[200000];

int n,m;

int v[200000],d[200000],c[200000];

void dfs(int x,int cnt,int c)

{

   if(!color[x])

       color[x]=c;

   if(flag[x]>=cnt)

       return;

   if(cnt==0)

       return;

   flag[x]=cnt;

   for(int i=0;i<q[x].size();i++)

       dfs(q[x][i],cnt-1,c);

}

int main()

{

    cin>>n>>m;

    for(int i=1;i<=m;i++)

    {

        int x,y;

        cin>>x>>y;

        q[x].push_back(y);

        q[y].push_back(x);

    }

    int q;

    cin>>q;

    for(int i=1;i<=q;i++)

       cin>>v[i]>>d[i]>>c[i];

    for(int i=q;i>=1;i--)

        dfs(v[i],d[i],c[i]);

    for(int i=1;i<=n;i++)

        cout<<color[i]<<endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 1.6404135572309215x):
#define _CRT_SECURE_NO_WARNINGS

#include <iostream>

#include <sstream>

#include <iomanip>

#include <cstdio>

#include <cstdlib>

#include <cmath>

#include <cctype>

#include <cstring>

#include <vector>

#include <list>

#include <queue>

#include <deque>

#include <stack>

#include <map>

#include <set>

#include <algorithm>

#include <iterator>

#include <bitset>

#include <ctime>

#include<complex>

using namespace std;



#define FOR(i,a,b) for (int i = (a); i < (b); i++)

#define RFOR(i,b,a) for (int i = (b)-1; i >= (a); i--)

#define ITER(it,a) for (__typeof(a.begin()) it = a.begin(); it != a.end(); it++)

#define FILL(a,value) memset(a, value, sizeof(a))



#define SZ(a) (int)a.size()

#define ALL(a) a.begin(), a.end()

#define PB push_back

#define MP make_pair



typedef long long LL;

typedef vector<int> VI;

typedef pair<int, int> PII;



const double PI = acos(-1.0);

const int INF = 1000 * 1000 * 1000 + 7;

const LL LINF = INF * (LL)INF;



const int MAX = 1000 * 100 + 47;



struct Item

{

	int v, d, c;

};



Item Q[MAX];

vector<int> g[MAX];

int U[MAX];

int D[MAX];

int C[MAX];

int iter;



void dfs(int v, int d, int curD, int color)

{

	if (d > curD) return;

	if (curD - d <= D[v]) return;

	D[v] = curD - d;

	if (C[v] == 0) C[v] = color;

	FOR(i, 0, SZ(g[v]))

	{

		int to = g[v][i];

		dfs(to, d + 1, curD, color);

	}

}



int main()

{

	//freopen("in.txt", "r", stdin);

	//freopen("out.txt", "w", stdout);

	//ios::sync_with_stdio(false); cin.tie(0);

	int n, m;

	cin >> n >> m;

	FOR(i, 0, m)

	{

		int a, b;

		cin >> a >> b;

		a--;

		b--;

		g[a].push_back(b);

		g[b].push_back(a);

	}



	int q;

	cin >> q;

	FOR(i, 0, q)

	{

		cin >> Q[i].v >> Q[i].d >> Q[i].c;

		Q[i].v--;

	}



	reverse(Q, Q + q);

	FILL(D, -1);

	FOR(i, 0, q)

	{

		dfs(Q[i].v, 0, Q[i].d, Q[i].c);

	}



	FOR(i, 0, n)

	{

		//cout << i + 1 << ": " << C[i] << "\n";

		cout << C[i] << "\n";



	}

}
// Slower C++ solution:
#include <vector>

#include <list>

#include <map>

#include <set>

#include <deque>

#include <stack>

#include <bitset>

#include <algorithm>

#include <functional>

#include <numeric>

#include <utility>

#include <sstream>

#include <iostream>

#include <iomanip>

#include <cstdio>

#include <cmath>

#include <cstdlib>

#include <ctime>

#include <memory.h>

#include <queue>



#define fr first

#define sc second

#define mk make_pair



using namespace std;



int n, m, color[100001], t[100001], dis[100001];

bool u[100001];

vector<int> vec[100001];

pair<int, int> ar[100001];



int main()

{

    cin >> n >> m;

    for(int i = 0; i < m; i++)

    {

        int a, b;

        scanf("%d%d", &a, &b);

        vec[a].push_back(b);

        vec[b].push_back(a);

    }



    int q;

    cin >> q;

    for(int i = 0; i < q; i++)

        scanf("%d%d%d", &ar[i].fr, &ar[i].sc, &t[i]);



    int v, d, col;

    queue <int> a, b, c;

    for(int i = q - 1; i >= 0; i--)

    {

        a.push(ar[i].fr);

        u[ar[i].fr] = 1;

        b.push(ar[i].sc);

        c.push(t[i]);

        while(!a.empty())

        {

            v = a.front(), d = b.front(), col = c.front();

           // cout << v << " " << d << " " << col << endl;

            u[v] = 0;

            a.pop();

            b.pop();

            c.pop();

            if(color[v] == 0 || dis[v] < d)

            {

                if(color[v] == 0)

                {

                    color[v] = col;

                    dis[v] = d;

                }else

                {

                    dis[v] = d;

                }

                if(d > 0)

                for(int i = 0; i < vec[v].size(); i++)

                {

                    if(color[vec[v][i]] == 0 || dis[vec[v][i]] < d - 1 && u[vec[v][i]] == 0)

                    {

                        u[vec[v][i]] = 1;

                        a.push(vec[v][i]);

                        b.push(d - 1);

                        c.push(col);

                    }

                }

            }

        }

    }



    for(int i = 1; i <= n; i++)

    {

        //cout << color[i] << endl;

        printf("%d\n", color[i]);

    }

    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 2.5183219504430703x):
#include<iostream>

#include<cstdio>

#include<cstring>

using namespace std;

int q[101000],H=0,T=0;

int col[101000],d[101000];

int h[101000],nxt[201000],to[201000],K=0;

int V[101000],D[101000],C[101000];

void ins(int u,int v){nxt[++K]=h[u];h[u]=K;to[K]=v;}

int main()

{

	int n,m;scanf("%d%d",&n,&m);

	for(int i=1;i<=m;i++)

	{

		int a,b;scanf("%d%d",&a,&b);

		ins(a,b);ins(b,a);

	}

	int Q;scanf("%d",&Q);

	for(int i=1;i<=Q;i++)scanf("%d%d%d",&V[i],&D[i],&C[i]);

	memset(d,-1,sizeof(d));

	for(int i=Q;i>=1;i--)

	{

		if(D[i]>d[V[i]])

		{

			H=T=0;d[V[i]]=D[i];q[T++]=V[i];

			while(H<T)

			{

				int x=q[H++];if(!col[x])col[x]=C[i];

				for(int j=h[x];j;j=nxt[j])

				{

					if(d[to[j]]<d[x]-1)

					{

						d[to[j]]=d[x]-1;

						q[T++]=to[j];

					}

				}

			}

		}

	}

	for(int i=1;i<=n;i++)printf("%d\n",col[i]);return 0;

 }
// Slower C++ solution:
//#pragma GCC optimize("O3")

#include <bits/stdc++.h>



using namespace std;



typedef long long ll;



const int N = (int) 1e5 + 5;

const int mod = (int) 1e9 + 7;



vector<int> g[N];

int n, m, Q, ans[N], ds[N], u[N];

int q[N * 100], qd[N * 100], qb, qe, t = 1, f[N];



void paint (int c) {

        while (qb < qe) {

                int v = q[qb], d = qd[qb++];

                if (ans[v] != 0 && ds[v] >= d) {

                        continue;

                }

                if (!ans[v]) {

                        ans[v] = c; ds[v] = d;

                }else



                {

                        ds[v] = d;

                }

                if (d) {

                        for (int to : g[v]) {

                                if (u[to] != t) {

                                        u[to] = t;

                                        q[qe] = to;

                                        qd[qe++] = d - 1;

                                }

                        }

                }

        }

        qb = qe = 0; ++t;

}



int v[N], d[N], c[N];



inline void solve () {

        scanf ("%d%d", &n, &m);

        for (int i = 1; i <= m; i++) {

                int x, y;

                scanf ("%d%d", &x, &y);

                g[x].emplace_back (y);

                g[y].emplace_back (x);

        }

        scanf ("%d", &Q);

        for (int i = 1; i <= Q; i++) {

                scanf ("%d%d%d", &v[i], &d[i], &c[i]);

        }

        for (int i = Q; i >= 1; i--) {

                q[qe] = v[i]; qd[qe++] = d[i];

                u[v[i]] = t;

                if (c[i] != c[i - 1]) {

                        paint (c[i]);

                }

        }

        for (int i = 1; i <= n; i++) {

                printf ("%d\n", ans[i]);

        }

}



int tests = 1;



int main () {

//        freopen (".in", "r", stdin);

//        freopen (".out", "w", stdout);

//        scanf ("%d", &tests);

        while (tests--) {

                solve ();

        }

        return 0;

}


// Faster C++ solution for the same problem (measured speedup: 2.5084667428689404x):
#include<iostream>

#include<cstdio>

#include<cstring>

using namespace std;

int q[101000],H=0,T=0;

int col[101000],d[101000];

int h[101000],nxt[201000],to[201000],K=0;

int V[101000],D[101000],C[101000];

void ins(int u,int v){nxt[++K]=h[u];h[u]=K;to[K]=v;}

int main()

{

	int n,m;scanf("%d%d",&n,&m);

	for(int i=1;i<=m;i++)

	{

		int a,b;scanf("%d%d",&a,&b);

		ins(a,b);ins(b,a);

	}

	int Q;scanf("%d",&Q);

	for(int i=1;i<=Q;i++)scanf("%d%d%d",&V[i],&D[i],&C[i]);

	memset(d,-1,sizeof(d));

	for(int i=Q;i>=1;i--)

	{

		if(D[i]>d[V[i]])

		{

			H=T=0;d[V[i]]=D[i];q[T++]=V[i];

			while(H<T)

			{

				int x=q[H++];if(!col[x])col[x]=C[i];

				for(int j=h[x];j;j=nxt[j])

				{

					if(d[to[j]]<d[x]-1)

					{

						d[to[j]]=d[x]-1;

						q[T++]=to[j];

					}

				}

			}

		}

	}

	for(int i=1;i<=n;i++)printf("%d\n",col[i]);return 0;

 }
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

int t[100100], us[100100][20];

vector <int> g[100100];

void func(int v, int d, int c)

{

    if(us[v][d])

        return;

    us[v][d] = 1;

    if(d == 0)

    {

        t[v] = c;

        return;

    }

    func(v, d - 1, c);

    for(int i = 0; i < g[v].size(); ++i)

        func(g[v][i], d - 1, c);

}



int main()

{

    int n, m, i, x, y, q, z;

    vector <pair <pair <int, int>, int> > v;



    cin >> n >> m;

    for(i = 0; i < m; ++i)

    {

        cin >> x >> y;

        g[x].push_back(y);

        g[y].push_back(x);

    }

    cin >> q;

    for(i = 0; i < q; ++i)

    {

        cin >> x >> y >> z;

        v.push_back(make_pair(make_pair(x, y), z));

    }

    while(!v.empty())

    {

        func(v.back().first.first, v.back().first.second, v.back().second);

        v.pop_back();

    }

    for(i = 1; i <= n; ++i)

        cout << t[i] << endl;



return 0;

}


// Faster C++ solution for the same problem (measured speedup: 2.530942291845824x):
#include<iostream>

#include<cstdio>

#include<cstring>

using namespace std;

int q[101000],H=0,T=0;

int col[101000],d[101000];

int h[101000],nxt[201000],to[201000],K=0;

int V[101000],D[101000],C[101000];

void ins(int u,int v){nxt[++K]=h[u];h[u]=K;to[K]=v;}

int main()

{

	int n,m;scanf("%d%d",&n,&m);

	for(int i=1;i<=m;i++)

	{

		int a,b;scanf("%d%d",&a,&b);

		ins(a,b);ins(b,a);

	}

	int Q;scanf("%d",&Q);

	for(int i=1;i<=Q;i++)scanf("%d%d%d",&V[i],&D[i],&C[i]);

	memset(d,-1,sizeof(d));

	for(int i=Q;i>=1;i--)

	{

		if(D[i]>d[V[i]])

		{

			H=T=0;d[V[i]]=D[i];q[T++]=V[i];

			while(H<T)

			{

				int x=q[H++];if(!col[x])col[x]=C[i];

				for(int j=h[x];j;j=nxt[j])

				{

					if(d[to[j]]<d[x]-1)

					{

						d[to[j]]=d[x]-1;

						q[T++]=to[j];

					}

				}

			}

		}

	}

	for(int i=1;i<=n;i++)printf("%d\n",col[i]);return 0;

 }
// Slower C++ solution:
#include <cstdio>

#include <memory.h>

#include <vector>

using namespace std;

const int maxn = 200005;

struct Query{

    int v, d, c;

}q[maxn];

int n, m, Q;

vector<int> G[maxn];

bool vis[maxn][15];

int color[maxn];



void solve(int v, int d, int c){

    if(vis[v][d]) return;

    if(color[v] == 0)    color[v] = c;

    if(d <= 0) return;



    for(int i = 0; i < G[v].size(); i++)

    {

        solve(G[v][i], d-1, c);

    }

    vis[v][d] = 1;



}

int main(){

//freopen("input.txt", "r", stdin);

    scanf("%d %d", &n, &m);

    memset(color, 0, sizeof(color));

    memset(vis, false, sizeof(vis));

    int a, b;

    for(int i = 0; i < m; i++)

    {

        scanf("%d %d", &a, &b);

        G[a].push_back(b);

        G[b].push_back(a);

    }

    scanf("%d", &Q);

    for(int i = 0; i < Q; i++)

    {

        scanf("%d %d %d", &q[i].v, &q[i].d, &q[i].c);

    }

    for(int i = Q-1; i >= 0; i--)

       solve(q[i].v, q[i].d, q[i].c);

    for(int i = 1; i <= n; i++)

        printf("%d\n", color[i]);

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 7.601915847620821x):
#include<iostream>

#include<cstdio>

#include<cstring>

using namespace std;

int q[101000],H=0,T=0;

int col[101000],d[101000];

int h[101000],nxt[201000],to[201000],K=0;

int V[101000],D[101000],C[101000];

void ins(int u,int v){nxt[++K]=h[u];h[u]=K;to[K]=v;}

int main()

{

	int n,m;scanf("%d%d",&n,&m);

	for(int i=1;i<=m;i++)

	{

		int a,b;scanf("%d%d",&a,&b);

		ins(a,b);ins(b,a);

	}

	int Q;scanf("%d",&Q);

	for(int i=1;i<=Q;i++)scanf("%d%d%d",&V[i],&D[i],&C[i]);

	memset(d,-1,sizeof(d));

	for(int i=Q;i>=1;i--)

	{

		if(D[i]>d[V[i]])

		{

			H=T=0;d[V[i]]=D[i];q[T++]=V[i];

			while(H<T)

			{

				int x=q[H++];if(!col[x])col[x]=C[i];

				for(int j=h[x];j;j=nxt[j])

				{

					if(d[to[j]]<d[x]-1)

					{

						d[to[j]]=d[x]-1;

						q[T++]=to[j];

					}

				}

			}

		}

	}

	for(int i=1;i<=n;i++)printf("%d\n",col[i]);return 0;

 }
// Slower C++ solution:
#include <bits/stdc++.h>

#define INF 0x3f3f3f3f

#define maxn 100100

#define lson root << 1

#define rson root << 1 | 1

#define lent (t[root].r - t[root].l + 1)

#define lenl (t[lson].r - t[lson].l + 1)

#define lenr (t[rson].r - t[rson].l + 1)

#define N 1111

#define eps 1e-6

#define pi acos(-1.0)

#define e exp(1.0)

using namespace std;

const int mod = 1e9 + 7;

typedef long long ll;

typedef unsigned long long ull;

vector<int> g[maxn];

int vis[maxn], col[maxn];

tuple<int, int, int> op[maxn];

void dfs(int v, int d, int c)

{

	if (vis[v] >= d)

		return;

	vis[v] = d;

	if (!col[v])

		col[v] = c;

	if (d)

	{

		int sz = g[v].size();

		for (int i = 0; i < sz; i++)

			dfs(g[v][i], d - 1, c);

	}

}

int main()

{

	int n, m, q;

	while (~scanf("%d%d", &n, &m))

	{

		for (int i = 1; i <= n; i++)

			g[i].clear();

		fill(vis, vis + n + 1, -1);

		fill(col, col + n + 1, 0);

		while (m--)

		{

			int u, v;

			scanf("%d%d", &u, &v);

			g[u].push_back(v);

			g[v].push_back(u);

		}

		scanf("%d", &q);

		for (int i = 0; i < q; i++)

		{

			int v, d, c;

			scanf("%d%d%d", &v, &d, &c);

			op[i] = tuple<int, int, int>(v, d, c);

		}

		for (int i = q - 1; i >= 0; i--)

		{

			int v, d, c;

			tie(v, d, c) = op[i];

			dfs(v, d, c);

		}

		for (int i = 1; i <= n; i++)

			printf("%d\n", col[i]);

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 2.5108960394938626x):
#include<iostream>

#include<cstdio>

#include<cstring>

using namespace std;

int q[101000],H=0,T=0;

int col[101000],d[101000];

int h[101000],nxt[201000],to[201000],K=0;

int V[101000],D[101000],C[101000];

void ins(int u,int v){nxt[++K]=h[u];h[u]=K;to[K]=v;}

int main()

{

	int n,m;scanf("%d%d",&n,&m);

	for(int i=1;i<=m;i++)

	{

		int a,b;scanf("%d%d",&a,&b);

		ins(a,b);ins(b,a);

	}

	int Q;scanf("%d",&Q);

	for(int i=1;i<=Q;i++)scanf("%d%d%d",&V[i],&D[i],&C[i]);

	memset(d,-1,sizeof(d));

	for(int i=Q;i>=1;i--)

	{

		if(D[i]>d[V[i]])

		{

			H=T=0;d[V[i]]=D[i];q[T++]=V[i];

			while(H<T)

			{

				int x=q[H++];if(!col[x])col[x]=C[i];

				for(int j=h[x];j;j=nxt[j])

				{

					if(d[to[j]]<d[x]-1)

					{

						d[to[j]]=d[x]-1;

						q[T++]=to[j];

					}

				}

			}

		}

	}

	for(int i=1;i<=n;i++)printf("%d\n",col[i]);return 0;

 }