Colorful Tree - 問題

#12017. Colorful Tree

統計

给一棵树，边有颜色。

定义一条路径合法为：路径上的颜色只在这条路径上出现。

独立询问 $m$ 次，每次问删去一个点后仍然合法的路径的最大长度。

仍然合法定义为：在原树合法，且删去的点不在该路径上。

输入格式

第一行两个整数 $n,m$ 。

接下来 $n-1$ 行，每行三个整数 $x,y,col$, 表示树上有一条连接 $(x,y)$、颜色为 $col$ 的边。

接下来 $m$ 行，每行一个整数 $x$ 表示一组询问。

输出格式

$m$ 行，每行一个整数表示询问的答案。

样例数据

样例输入

样例输出

子任务

$m \le n \le 10^5, 1 \le x,y,col \le n$

子任务一（$9$ 分），$n \le 100$。

子任务二（$11$ 分），$n \le 1000$。

子任务三（$17$ 分），保证树的结构为一条链。

子任务四（$23$ 分），$m = 1$。

子任务五（$40$ 分），无特殊限制。

About Issues

We understand that our problem archive is not perfect. If you find any issues with the problem, including the statement, scoring configuration, time/memory limits, test cases, etc.

You may use this form to submit an issue regarding the problem. A problem moderator will review your issue and proceed it properly.

STOP! Before you submit an issue, please READ the following guidelines:

This is not a place to publish a discussion, editorial, or requests to debug your code. Your issue will only be visible by you and problem moderators. Other users will not be able to view or reply your issues.
Do not submit duplicated issues. If you have already submitted one, please wait for an moderator to review it. Submitting multiple issues will not speed up the review process and might cause your account to be banned.
Issues must be filed in English or Chinese only.
Be sure your issue is related to this problem. If you need to submit an issue regarding another problem, contest, category, etc., you should submit it to the corresponding page.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0