树链剖分。
先做轻重链剖分后,维护每一条链上的信息。初始树为空。
以每一条重链的头top为基点,建立单调栈。栈内维护,从大到小,该链上修改的深度,以及对应颜色。
每一次修改,如果栈内有比他浅的点,即,若我们把当前的颜色涂上,会使得之前的颜色覆盖掉,故我们清除掉该颜色。不断弹栈,直到为空或者栈顶比他深度深。若栈顶比他深,优先修改,当前的颜色的深度,即,把深度更深的颜色,给修改为空,我们才能重新计算并且涂上颜色。
然后每一个跳top的father的时候,我们单独把所有的,这样的top-father拿出来计算即可。
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<climits>
#include<stack>
#include<vector>
#include<queue>
#include<set>
#include<bitset>
#include<map>
//#include<regex>
#include<cstdio>
#include <iomanip>
#pragma GCC optimize(2)
#define up(i,a,b) for(int i=a;i<b;i++)
#define dw(i,a,b) for(int i=a;i>b;i--)
#define upd(i,a,b) for(int i=a;i<=b;i++)
#define dwd(i,a,b) for(int i=a;i>=b;i--)
//#define local
typedef long long ll;
typedef unsigned long long ull;
const double esp = 1e-6;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int inf = 1e9;
using namespace std;
int read()
{
char ch = getchar(); int x = 0, f = 1;
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;
}
typedef pair<int, int> pir;
#define lson l,mid,root<<1
#define rson mid+1,r,root<<1|1
#define lrt root<<1
#define rrt root<<1|1
const int N = 2e5 + 10;
vector<int>g[N];
int u, v, n, q, c, m, cr;
int col[N], cnt[N];
int id_s = 0;
int id[N], siz[N], son[N], top[N], f[N];
//int eg[N];
//int rk[N];
vector<pir>s[N];
void dfs1(int now, int fa, int d)
{
//rk[u] = ++tot_;
f[now] = fa;
//dep[u] = d;
siz[now] = 1;
for (auto k : g[now])
{
if (k == fa)continue;
dfs1(k, now, d + 1);
siz[now] += siz[k];
if (siz[son[now]] < siz[k])
{
son[now] = k;
}
}
return;
}
void dfs2(int now, int tp)
{
id[now] = ++id_s;
top[now] = tp;
if (son[now])
{
dfs2(son[now], tp);
}
for (auto k : g[now])
{
if (k == f[now] || k == son[now])continue;
dfs2(k, k);
}
return;
}
void modify(int val, int c)
{
cnt[col[c]]--;
col[c] += val;
cnt[col[c]]++;
}
void update(int l, int r, int c)
{
}
int main()
{
scanf("%d %d %d", &n, &cr, &q);
upd(i, 1, n - 1)
{
scanf("%d %d", &u, &v);
g[u].push_back(v);
g[v].push_back(u);
}
cnt[0] = cr;
//col[0] = n - 1;
//num[n - 1] = 1;
dfs1(1, 0, 1);
dfs2(1, 1);
while (q--)
{
scanf("%d %d %d", &u, &v, &m);
while (u)
{
int tp = top[u];
int pr = id[tp] - 1;
while (!s[tp].empty() && s[tp].back().first < id[u])
{
pir temp = s[tp].back();
s[tp].pop_back();
modify(-(temp.first - pr), temp.second);
pr = temp.first;
}
if (!s[tp].empty())
{
modify(-(id[u] - pr), s[tp].back().second);
}
s[tp].push_back(make_pair(id[u], v));
modify(id[u] - id[tp] + 1, v);
u = f[tp];
//if (u == 0)break;
}
int ans = cnt[m];
if (col[v] == m)ans--;
else if (col[v] == m + 1)ans++;
printf("%d\n", ans);
}
return 0;
}