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

using namespace std;



const int N = 300001;

int n, m, tot = 0, q;

int head[N], Next[N], ver[N], num[N];

int ans[N][20] = {};

struct edge{

	int x, y, z;

}a[N];



vector <int> vis[N];



void dfs(int x,int y,int z) {

	if (y == -1) return;

	if (ans[x][y]) return;

	ans[x][y] = z;

	for (int i=0;i<vis[x].size();++i) dfs(vis[x][i], y-1, z);

}



int main() {

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

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

		int x, y;

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

		vis[x].push_back(y);

		vis[y].push_back(x);

	}

	for (int i=1;i<=n;i++) vis[i].push_back(i);

	scanf("%d",&q);

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

		int x, y, z;

		scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].z);

	}

	for (int i=q;i;--i) dfs(a[i].x, a[i].y, a[i].z);

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

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 2.6618782588741743x):
#include<bits/stdc++.h>



typedef long long ll;



const int maxn = 1e5+10;



int cor[maxn][14], qwq[maxn], qaq[maxn], c[maxn];



std::vector <int> pb[maxn];



int n, m, a, b, q;



void l(int v1, int deep, int dd)

{

    if(deep==-1)  return;

    if(cor[v1][deep] ) return;

    cor[v1][deep]=dd;

    for(int i =0;i<pb[v1].size();i++)

        l(pb[v1][i], deep-1, dd);

}



int read()

{

	int x=0, ch= getchar(), f=1;

	while(!isdigit(ch)){ if(ch == '-')f = -1, ch = getchar();}

	while(isdigit(ch)) x = x *10 + ch-'0', ch = getchar();

	return x * f;

} 



int main()

{

    n=read(), m=read();

    for(int i=1;i<=m;i++) a=read(), b=read(), pb[a].push_back(b), pb[b].push_back(a);

    for(int i=1;i<=n;i++) pb[i].push_back(i);

    q=read();

    for(int i=1;i<=q;i++) qwq[i]=read(), qaq[i] = read(), c[i] = read();

    for(int i=q;i>=1;i--)  l(qwq[i], qaq[i], c[i]);

    for(int i=1;i<=n;i++) std::cout<<cor[i][0]<<std::endl;

    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: 3.027570926095844x):
#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;

}
// 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: 1.9656998829567103x):
#include<stdio.h>

#include<string.h>

#include<iostream>

#include<algorithm>

#include<queue>

using namespace std;

const int maxn=(int)1e5+10;

int read()

{

    int x=0,f=1;char ch=getchar();

    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}

    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}

    return x*f;

}

struct node{

	int to,nxt;

}ed[maxn<<1];

int head[maxn],cnt;

void addedge(int u,int v){

	ed[cnt].to=v;

	ed[cnt].nxt=head[u];

	head[u]=cnt++;

}

int st[maxn],d[maxn],c[maxn],mark[maxn],dis[maxn],col[maxn];

vector<int>vx;

int main()

{

	int n,m;

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

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

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

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

		int u,v;

		u=read(),v=read();

		addedge(u,v);

		addedge(v,u);

	}

	int q;

	scanf("%d",&q);

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

		st[i]=read();d[i]=read();c[i]=read();

	}

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

		if(d[i]<=mark[st[i]])continue;

		queue<int>q;

		q.push(st[i]);

		while(!q.empty()){

			int u=q.front();q.pop();

			if(dis[u]+mark[u]>=d[i])continue;

			if(col[u]==0)col[u]=c[i];	

			mark[u]=d[i]-dis[u];

			for(int j=head[u];~j;j=ed[j].nxt){

				int v=ed[j].to;

				if(dis[v]==0&&v!=st[i]&&dis[u]<d[i]){

					dis[v]=dis[u]+1;

					vx.push_back(v);

					q.push(v);

				}

			}

		}

		for(int j=0;j<vx.size();j++)dis[vx[j]]=0;

		vx.clear();

	}

	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: 5.904158755440042x):
#include<stdio.h>

#include<string.h>

#include<iostream>

#include<algorithm>

#include<queue>

using namespace std;

const int maxn=(int)1e5+10;

int read()

{

    int x=0,f=1;char ch=getchar();

    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}

    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}

    return x*f;

}

struct node{

	int to,nxt;

}ed[maxn<<1];

int head[maxn],cnt;

void addedge(int u,int v){

	ed[cnt].to=v;

	ed[cnt].nxt=head[u];

	head[u]=cnt++;

}

int st[maxn],d[maxn],c[maxn],mark[maxn],dis[maxn],col[maxn];

vector<int>vx;

int main()

{

	int n,m;

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

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

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

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

		int u,v;

		u=read(),v=read();

		addedge(u,v);

		addedge(v,u);

	}

	int q;

	scanf("%d",&q);

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

		st[i]=read();d[i]=read();c[i]=read();

	}

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

		if(d[i]<=mark[st[i]])continue;

		queue<int>q;

		q.push(st[i]);

		while(!q.empty()){

			int u=q.front();q.pop();

			if(dis[u]+mark[u]>=d[i])continue;

			if(col[u]==0)col[u]=c[i];	

			mark[u]=d[i]-dis[u];

			for(int j=head[u];~j;j=ed[j].nxt){

				int v=ed[j].to;

				if(dis[v]==0&&v!=st[i]&&dis[u]<d[i]){

					dis[v]=dis[u]+1;

					vx.push_back(v);

					q.push(v);

				}

			}

		}

		for(int j=0;j<vx.size();j++)dis[vx[j]]=0;

		vx.clear();

	}

	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: 1.950130616115295x):
#include<stdio.h>

#include<string.h>

#include<iostream>

#include<algorithm>

#include<queue>

using namespace std;

const int maxn=(int)1e5+10;

int read()

{

    int x=0,f=1;char ch=getchar();

    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}

    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}

    return x*f;

}

struct node{

	int to,nxt;

}ed[maxn<<1];

int head[maxn],cnt;

void addedge(int u,int v){

	ed[cnt].to=v;

	ed[cnt].nxt=head[u];

	head[u]=cnt++;

}

int st[maxn],d[maxn],c[maxn],mark[maxn],dis[maxn],col[maxn];

vector<int>vx;

int main()

{

	int n,m;

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

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

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

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

		int u,v;

		u=read(),v=read();

		addedge(u,v);

		addedge(v,u);

	}

	int q;

	scanf("%d",&q);

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

		st[i]=read();d[i]=read();c[i]=read();

	}

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

		if(d[i]<=mark[st[i]])continue;

		queue<int>q;

		q.push(st[i]);

		while(!q.empty()){

			int u=q.front();q.pop();

			if(dis[u]+mark[u]>=d[i])continue;

			if(col[u]==0)col[u]=c[i];	

			mark[u]=d[i]-dis[u];

			for(int j=head[u];~j;j=ed[j].nxt){

				int v=ed[j].to;

				if(dis[v]==0&&v!=st[i]&&dis[u]<d[i]){

					dis[v]=dis[u]+1;

					vx.push_back(v);

					q.push(v);

				}

			}

		}

		for(int j=0;j<vx.size();j++)dis[vx[j]]=0;

		vx.clear();

	}

	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: 1.650424294170195x):
#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;

}
// 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: 17.759266905441493x):
#include <cstdio>

#include <algorithm>

#define maxn 100000+10

using namespace std;

int f[maxn],ans[maxn],n,m,Q,x,y,z,head[maxn],g;

struct xx

{

	int v,next;

}b[maxn<<1];



struct yy

{

	int x,d,col;

}a[maxn];



void add(int u,int v)

{

	b[++g]=(xx){v,head[u]};

	head[u]=g;

}



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

{

	if (f[x]>=d) return ;

	f[x]=d;

	if (d<=0)return ;

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

	for (int i=head[x];i;i=b[i].next)

	{

		int v=b[i].v;

		dfs(v,d-1,col);

	}

}



int main()

{

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

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

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

	scanf("%d",&Q);

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

	  scanf("%d%d%d",&x,&y,&z),a[i]=(yy){x,y+1,z};

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

	  dfs(a[i].x,a[i].d,a[i].col);

	for (int i=1;i<=n;++i) printf("%d\n",ans[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: 17.68976774482515x):
#include <cstdio>

#include <algorithm>

#define maxn 100000+10

using namespace std;

int f[maxn],ans[maxn],n,m,Q,x,y,z,head[maxn],g;

struct xx

{

	int v,next;

}b[maxn<<1];



struct yy

{

	int x,d,col;

}a[maxn];



void add(int u,int v)

{

	b[++g]=(xx){v,head[u]};

	head[u]=g;

}



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

{

	if (f[x]>=d) return ;

	f[x]=d;

	if (d<=0)return ;

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

	for (int i=head[x];i;i=b[i].next)

	{

		int v=b[i].v;

		dfs(v,d-1,col);

	}

}



int main()

{

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

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

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

	scanf("%d",&Q);

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

	  scanf("%d%d%d",&x,&y,&z),a[i]=(yy){x,y+1,z};

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

	  dfs(a[i].x,a[i].d,a[i].col);

	for (int i=1;i<=n;++i) printf("%d\n",ans[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: 17.84826585625867x):
#include <cstdio>

#include <algorithm>

#define maxn 100000+10

using namespace std;

int f[maxn],ans[maxn],n,m,Q,x,y,z,head[maxn],g;

struct xx

{

	int v,next;

}b[maxn<<1];



struct yy

{

	int x,d,col;

}a[maxn];



void add(int u,int v)

{

	b[++g]=(xx){v,head[u]};

	head[u]=g;

}



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

{

	if (f[x]>=d) return ;

	f[x]=d;

	if (d<=0)return ;

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

	for (int i=head[x];i;i=b[i].next)

	{

		int v=b[i].v;

		dfs(v,d-1,col);

	}

}



int main()

{

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

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

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

	scanf("%d",&Q);

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

	  scanf("%d%d%d",&x,&y,&z),a[i]=(yy){x,y+1,z};

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

	  dfs(a[i].x,a[i].d,a[i].col);

	for (int i=1;i<=n;++i) printf("%d\n",ans[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: 53.60889321830005x):
#include <cstdio>

#include <algorithm>

#define maxn 100000+10

using namespace std;

int f[maxn],ans[maxn],n,m,Q,x,y,z,head[maxn],g;

struct xx

{

	int v,next;

}b[maxn<<1];



struct yy

{

	int x,d,col;

}a[maxn];



void add(int u,int v)

{

	b[++g]=(xx){v,head[u]};

	head[u]=g;

}



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

{

	if (f[x]>=d) return ;

	f[x]=d;

	if (d<=0)return ;

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

	for (int i=head[x];i;i=b[i].next)

	{

		int v=b[i].v;

		dfs(v,d-1,col);

	}

}



int main()

{

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

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

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

	scanf("%d",&Q);

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

	  scanf("%d%d%d",&x,&y,&z),a[i]=(yy){x,y+1,z};

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

	  dfs(a[i].x,a[i].d,a[i].col);

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

	return 0;

}