#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <set>
#include <algorithm>
#include <cstring>
using namespace std;

#define MAXN 50011
#define MAXLG 18
#define INF (1<<30)

int N, M, ans[MAXN],ed[MAXN][2];
vector<int> adj[MAXN];
vector<pair<int,int> > action[MAXN];

int dpth[MAXN], p[MAXLG][MAXN];
void dfs1(int x, int par) {
    
    dpth[x] = dpth[par] + 1;
    p[0][x] = par;
    
    for (int i = 0; i < (int)adj[x].size(); i++) {
        if (adj[x][i] == par) continue;
        else dfs1(adj[x][i], x);
    }
}

multiset<int> mst[MAXN];
int dfs2(int x, int par) {
    int id = x;
    for (int i = 0; i < (int)adj[x].size(); i++) {
        if (adj[x][i] == par) continue;
        int nxt = dfs2(adj[x][i], x);
        
        if (mst[nxt].size() < mst[id].size()) {
            mst[id].insert(mst[nxt].begin(), mst[nxt].end());
        } else {
            if (mst[id].size()) mst[nxt].insert(mst[id].begin(), mst[id].end());
            id = nxt;
        }
    }
    
    for (int i = 0; i < (int)action[x].size(); i++) {
        int a = action[x][i].first, b = action[x][i].second;
        
        if (a) mst[id].insert(b);
        else if (mst[id].find(b) != mst[id].end())
            mst[id].erase(mst[id].find(b));
    }
    
    if (mst[id].size()) ans[x] = *mst[id].begin();
    else ans[x] = -1;
    return id;
}

int lca(int a, int b) {
    if (dpth[a] < dpth[b])
        swap(a,b);
    
    int diff = dpth[a] - dpth[b];
    for (int i = MAXLG-1; i >= 0; i--)
        if (diff & (1<<i)) a = p[i][a];
    
    if (a == b) return a;
    for (int i = MAXLG-1; i >= 0; i--)
        if (p[i][a] != p[i][b]) {a=p[i][a];b=p[i][b];}
    
    return p[0][a];
}

int main()
{
    if (fopen("disrupt.in", "r")) {
        freopen("disrupt.in", "r", stdin);
        freopen("disrupt.out", "w", stdout);
    } else freopen("data.in", "r", stdin);
    
    scanf("%d %d", &N, &M);
    for (int i = 1; i < N; i++) {
        int a, b;
        scanf("%d", &a);
        scanf("%d", &b);
        
        adj[a].push_back(b);
        adj[b].push_back(a);
        
        ed[i][0] = a;
        ed[i][1] = b;
    }
    
    dfs1(1,1);
    for (int i = 1; i < MAXLG; i++) {
        for (int x = 1; x <= N; x++) {
            p[i][x] = p[i-1][p[i-1][x]];
        }
    }
    
    for (int i = 1; i <= M; i++) {
        int a, b, w;
        scanf("%d", &a);
        scanf("%d", &b);
        scanf("%d", &w);
        
        int c = lca(a, b);
        if (c != a) {
            action[a].push_back(make_pair(1,w));
            action[c].push_back(make_pair(0,w));
        }
        if (c != b) {
            action[b].push_back(make_pair(1,w));
            action[c].push_back(make_pair(0,w));
        }
    }
    
    dfs2(1,1);
    for (int i = 1; i < N; i++) {
        if (p[0][ed[i][0]] == ed[i][1])
            printf("%d\n", ans[ed[i][0]]);
        else printf("%d\n", ans[ed[i][1]]);
    }
    
}