1 #include<bits/stdc++.h>
 2 const int N=8e4+10;
 3 using namespace std;
 4 int n,m,q,tot,fa[N][18],dfn[N],tim,last[N],dep[N],ans[N],sum[N],head[N],cnt;
 5 struct edge{int to,nex;}e[N<<1];
 6 struct Plate{int x1,x2,y1,y2,v;}pla[N];
 7 struct node{int x,y1,y2,v,id;}eve[N];
 8 struct fruit{int x,y,k,id;}fru[N],s1[N],s2[N];
 9 bool cmp(Plate a,Plate b){return a.v<b.v;}
10 bool cmp1(node a,node b){return a.x==b.x?a.id<b.id:a.x<b.x;}
11 void add(int s,int t){e[++cnt]=(edge){t,head[s]},head[s]=cnt;}
12
13 class Bit{
14 public:
15     int val[N];
16     void modify(int l,int r,int v){
17         for (int i=l;i<=n;i+=(i&(-i))) val[i]+=v;
18         for (int i=r+1;i<=n;i+=(i&(-i))) val[i]-=v;
19     }
20     int query(int x){int res=0;for (;x;x-=(x&(-x))) res+=val[x];return res;}
21 }T;
22
23 void dfs(int x){
24     dfn[x]=++tim;
25     for (int i=0;fa[x][i];i++) fa[x][i+1]=fa[fa[x][i]][i];
26     for (int k=head[x],v;k;k=e[k].nex)
27         if ((v=e[k].to)!=fa[x][0])
28             fa[v][0]=x,dep[v]=dep[x]+1,dfs(v);
29     last[x]=tim;
30 }
31 int jump(int a,int h){for (int i=16;h;i--) if (h>=(1<<i)) h-=(1<<i),a=fa[a][i];return a;}
32 int lca(int a,int b){
33     if (dep[a]<dep[b]) swap(a,b);
34     a=jump(a,dep[a]-dep[b]);
35     if (a==b) return a;
36     for (int i=16;i>=0;i--) if (fa[a][i]!=fa[b][i]) a=fa[a][i],b=fa[b][i];
37     return fa[a][0];
38 }
39
40 void solve(int l,int r,int st,int ed){
41     if (st>ed) return;
42     if (l==r){
43         for (int i=st;i<=ed;i++) ans[fru[i].id]=pla[l].v;
44         return;
45     }
46     int mid=(l+r)>>1,siz=0;
47     for (int i=l;i<=mid;i++){
48         eve[++siz]=(node){pla[i].x1,pla[i].y1,pla[i].y2,1,0};
49         eve[++siz]=(node){pla[i].x2,pla[i].y1,pla[i].y2,-1,n+1};
50     }
51     for (int i=st;i<=ed;i++) eve[++siz]=(node){fru[i].x,fru[i].y,0,0,i};
52     sort(eve+1,eve+1+siz,cmp1);
53     for (int i=1;i<=siz;i++)
54         if (st<=eve[i].id&&eve[i].id<=ed) sum[eve[i].id]=T.query(eve[i].y1);
55         else T.modify(eve[i].y1,eve[i].y2,eve[i].v);
56     int a=0,b=0;
57     for (int i=st;i<=ed;i++) {
58         if (sum[i]>=fru[i].k) s1[++a]=fru[i];
59         else s2[++b]=(fruit){fru[i].x,fru[i].y,fru[i].k-sum[i],fru[i].id};
60     }
61     for (int i=st;i<=st+a-1;i++) fru[i]=s1[i-st+1];
62     for (int i=st+a;i<=ed;i++) fru[i]=s2[i-st-a+1];
63     solve(l,mid,st,st+a-1),solve(mid+1,r,st+a,ed);
64 }
65
66 int main(){
67     scanf("%d%d%d",&n,&m,&q);
68     for (int i=1,a,b;i<n;i++) scanf("%d%d",&a,&b),add(a,b),add(b,a);
69     dfs(1);
70     for (int i=1,a,b,c,u;i<=m;i++){
71         scanf("%d%d%d",&a,&b,&c);u=lca(a,b);
72         if (dfn[a]>dfn[b]) swap(a,b);
73         if (u!=a) pla[++tot]=(Plate){dfn[a],last[a],dfn[b],last[b],c};
74         else{
75             int w=jump(b,dep[b]-dep[a]-1);
76             pla[++tot]=(Plate){1,dfn[w]-1,dfn[b],last[b],c};
77             if (last[w]<n) pla[++tot]=(Plate){dfn[b],last[b],last[w]+1,n,c};
78         }
79     }
80     sort(pla+1,pla+1+tot,cmp);
81     for (int i=1,a,b,k;i<=q;i++){
82         scanf("%d%d%d",&a,&b,&k);
83         if (dfn[a]>dfn[b]) swap(a,b);
84         fru[i]=(fruit){dfn[a],dfn[b],k,i};
85     }
86     solve(1,tot,1,q);
87     for (int i=1;i<=q;i++) printf("%d\n",ans[i]);
88     return 0;
89 }