#include "bits/stdc++.h"

#ifdef WINT_MIN
#define __MAI
#endif

using namespace std;
typedef unsigned int uint;
typedef long long int ll;
typedef unsigned long long int ull;

#define debugv(v) printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;
#define debugm(m) printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;
#define debugaa(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}
#define debugaar(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}
#define ALL(v) (v).begin(),(v).end()
#define BIGINT 0x7FFFFFFF
#define E107 1000000007ll
void printbit(int u) { if (u == 0)cout << 0; else { int s = 0, k = 0; for (; 0<u; u >>= 1, k++)s = (s << 1) | (u & 1); for (; 0<k--; s >>= 1)cout << (s & 1); } }template<typename T1, typename T2>
    ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }

#define TIME chrono::system_clock::now()
#define MILLISEC(t) (chrono::duration_cast<chrono::milliseconds>(t).count())

namespace {
    std::chrono::system_clock::time_point t;
    void tic() { t = TIME; }
    void toc() { fprintf(stderr, "TIME : %lldms\n", MILLISEC(TIME - t)); }
    std::chrono::system_clock::time_point tle = TIME;
#ifdef __MAI
    void safe_tle(int msec) { assert(MILLISEC(TIME - tle) < msec); }
#else
#define safe_tle(k) ;
#endif
}

#ifndef __MAI 
namespace {
    class MaiScanner {
    public:
        template<typename T>
        void input_integer(T& var) {
            var = 0;
            T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var*sign;
        }
        void ign() { getchar_unlocked(); }
        MaiScanner& operator>>(int& var) {
            input_integer<int>(var);
            return *this;
        }
        MaiScanner& operator>>(long long& var) {
            input_integer<long long>(var);
            return *this;
        }
    };
}
MaiScanner scanner;
#else
#define scanner cin
#endif

class Graph {
public:
    size_t n;
    vector<vector<int>> vertex_to;

    Graph(size_t n) :n(n), vertex_to(n) {}

    void connect(int from, int to) {
        vertex_to[from].emplace_back(to);
        vertex_to[to].emplace_back(from);
    }
    void resize(size_t _n) {
        n = _n;
        vertex_to.resize(_n);
    }
};

int width, height;
int m, n, qq;

int queries[100010][3];

int color[100010];

// time,color
pair<int,int> painting[100010][11];

Graph g(1);

int main() {
    int i, j, k;
    int x, y, a, b;

    scanner >> n >> m;

    g.resize(n);

    for (i = 0; i < m; ++i) {
        scanner >> a >> b;
        --a; --b;
        g.connect(a, b);
    }

    scanner >> qq;
    int vs, d, c;
    for (i = 0; i < qq; ++i) {
        //scanner >> queries[i][0] >> queries[i][1] >> queries[i][2];
        scanner >> vs >> d >> c;
        --vs;
        painting[vs][d] = make_pair(i + 1 , c);
    }

    int t;
    for (d = 10; 1 <= d; --d) {
        for (vs = 0; vs < n; ++vs) {
            c = painting[vs][d].second;
            if (c == 0) continue;
            t = painting[vs][d].first;
            if (painting[vs][d - 1].first < t)
                painting[vs][d - 1] = make_pair(t, c);
            for (int u : g.vertex_to[vs]) {
                auto p = painting[u][d - 1];
                if (p.first < t) {
                    painting[u][d - 1] = make_pair(t, c);
                }
            }
        }
    }
    for (i = 0; i < n; ++i) {
        printf("%d\n", painting[i][0].second);
    }


    return 0;
}

Measured memory_bytes: 15096