1 #include<bits/stdc++.h>
  2 using namespace std;
  3 #define ll long long
  4 #define N 200050
  5 struct Edge{int from,to,s;}edges[N<<1];
  6 struct Query
  7 {
  8   int x,val,id;
  9   bool operator <(const Query&b)const
 10   {return x<b.x;}
 11 }a[N<<2];
 12 struct Tree{int l,r,mx,wmx;}tr[N<<2];
 13 int n,m,num,ans[N];
 14 int tot,last[N];
 15 int cnt,fa[N],dp[N],size[N],son[N],rk[N],kth[N],top[N];
 16 template<typename T>void read(T&x)
 17 {
 18   ll k=0; char c=getchar();
 19   x=0;
 20   while(!isdigit(c)&&c!=EOF)k^=c==‘-‘,c=getchar();
 21   if (c==EOF)exit(0);
 22   while(isdigit(c))x=x*10+c-‘0‘,c=getchar();
 23   x=k?-x:x;
 24 }
 25 void read_char(char &c)
 26 {while(!isalpha(c=getchar())&&c!=EOF);}
 27 void AddEdge(int x,int y)
 28 {
 29   edges[++tot]=Edge{x,y,last[x]};
 30   last[x]=tot;
 31 }
 32 void dfs1(int x,int pre)
 33 {
 34   fa[x]=pre;
 35   dp[x]=dp[pre]+1;
 36   size[x]=1;
 37   son[x]=0;
 38   for(int i=last[x];i;i=edges[i].s)
 39     {
 40       Edge &e=edges[i];
 41       if (e.to==pre)continue;
 42       dfs1(e.to,x);
 43       size[x]+=size[e.to];
 44       if (size[e.to]>size[son[x]])
 45     son[x]=e.to;
 46     }
 47 }
 48 void dfs2(int x,int y)
 49 {
 50   rk[x]=++cnt;
 51   kth[cnt]=x;
 52   top[x]=y;
 53   if (son[x]==0)return;
 54   dfs2(son[x],y);
 55   for(int i=last[x];i;i=edges[i].s)
 56     {
 57       Edge e=edges[i];
 58       if (e.to==fa[x]||e.to==son[x])continue;
 59       dfs2(e.to,e.to);
 60     }
 61 }
 62 void push_up(Tree &c,Tree a,Tree b)
 63 {
 64   c.mx=max(a.mx,b.mx);
 65   c.wmx=c.mx==a.mx?a.wmx:b.wmx;
 66 }
 67 void bt(int x,int l,int r)
 68 {
 69   tr[x]=Tree{l,r,0,0};
 70   if (l==r){tr[x].wmx=l;return;}
 71   int mid=(l+r)>>1;
 72   bt(x<<1,l,mid);
 73   bt(x<<1|1,mid+1,r);
 74 }
 75 void update(int x,int p,int tt)
 76 {
 77   if (p<=tr[x].l&&tr[x].r<=p)
 78     {
 79       tr[x].mx+=tt;
 80       tr[x].wmx=tr[x].l;
 81       return;
 82     }
 83   int mid=(tr[x].l+tr[x].r)>>1;
 84   if (p<=mid)update(x<<1,p,tt);
 85   if (mid<p)update(x<<1|1,p,tt);
 86   push_up(tr[x],tr[x<<1],tr[x<<1|1]);
 87 }
 88 void change(int x,int y,int tt)
 89 {
 90   int fx=top[x],fy=top[y];
 91   while(fx!=fy)
 92     {
 93       if (dp[fx]<dp[fy])swap(x,y),swap(fx,fy);
 94       a[++num]=Query{rk[fx],tt,1};
 95       a[++num]=Query{rk[x]+1,tt,-1};
 96       x=fa[fx];fx=top[x];
 97     }
 98   if (dp[x]<dp[y])swap(x,y);
 99   a[++num]=Query{rk[y],tt,1};
100   a[++num]=Query{rk[x]+1,tt,-1};
101 }
102 void work()
103 {
104   read(n); read(m);
105   if (n==0)exit(0);
106   for(int i=1;i<=n-1;i++)
107     {
108       int x,y;
109       read(x); read(y);
110       AddEdge(x,y);
111       AddEdge(y,x);
112     }
113   dfs1(1,0);
114   dfs2(1,1);
115   bt(1,0,100005);
116   for(int i=1;i<=m;i++)
117     {
118       int x,y,tt;
119       read(x); read(y); read(tt);
120       change(x,y,tt);
121     }
122   sort(a+1,a+num+1);
123   for(int i=1;i<=num-1;i++)
124     {
125       int l=a[i].x;
126       update(1,a[i].val,a[i].id);
127       while(a[i+1].x==a[i].x)
128     //update(1,a[++i].val,a[i].id);
129     i++,update(1,a[i].val,a[i].id);
130       
131       for(int j=l;j<a[i+1].x;j++)
132     ans[kth[j]]=tr[1].wmx;
133     }
134   for(int i=1;i<=n;i++)printf("%d\n",ans[i]);
135 }
136 void clear()
137 {
138   tot=0; cnt=0; num=0;
139   memset(last,0,sizeof(last));
140   memset(ans,0,sizeof(ans));
141 }
142 int main()
143 {
144 #ifndef ONLINE_JUDGE
145   freopen("aa.in","r",stdin);
146 #endif
147   while(1)
148     {
149       clear();
150       work();
151     }
152 }