[codeforces1139C]Edgy Trees

time limit per test : 2 seconds
memory limit per test : 256 megabytes

You are given a tree (a connected undirected graph without cycles) of $n$ vertices. Each of the $n-1$ edges of the tree is colored in either black or red.

You are also given an integer $k$ . Consider sequences of $k$ vertices. Let’s call a sequence $[a_1,a_2,\dots ,a_k]$
good if it satisfies the following criterion:

We will walk a path (possibly visiting same edge/vertex multiple times) on the tree, starting from $a_1$ and ending at $a_k$.
Start at $a_1$, then go to $a_2$ using the shortest path between $a_1$ and $a_2$, then go to a 3 a_3 a