Upside Down

题意翻译

给出一棵 $n$ 个节点的树，每一条边上有一个小写字母。 给定 $m$ 个字符串 $s$。 有 $q$ 组询问，每组询问包含三个数：$i,j,k$，表示如下询问： 以从 $i$ 到 $j$ 的路径上每一条边的字母连接起来所构成的字符串为文本串，$s_k$ 为模式串，求 $s_k$ 在文本串中出现的次数。

题目描述

As we all know, Eleven has special abilities. Thus, Hopper convinced her to close the gate to the Upside Down World with her mind. Upside down monsters like to move between the worlds, so they are going to attack Hopper and Eleven in order to make them stop. The monsters live in the vines. The vines form a tree with $ n $ vertices, numbered from $ 1 $ through $ n $ . There's a lowercase English letter written in each tunnel (edge). Upside down is a magical world. There are $ m $ types of monsters in upside down, numbered from $ 1 $ through $ m $ . Each type of monster has a special word that gives them powers. The special word of type $ i $ is $ s_{i} $ . There are $ q $ monsters in upside down. Each one is at a junction (vertex) and is going to some other junction. If monster of type $ k $ goes from junction $ i $ to junction $ j $ , the power it gains is the number of times it sees its special world ( $ s_{k} $ ) consecutively in the tunnels. More formally: If $ f(i,j) $ is the string we get when we concatenate the letters written in the tunnels on the shortest path from $ i $ to $ j $ , then the power the monster gains is the number of occurrences of $ s_{k} $ in $ f(i,j) $ . Hopper and Eleven want to get prepared, so for each monster, they want to know the power the monster gains after moving.

输入输出格式

输入格式

The first line of input contains three integers, $ n,m $ and $ q $ ( $ 2<=n<=10^{5} $ , $ 1<=m,q<=10^{5} $ ). The next $ n-1 $ lines contain the tunnels (edges). Each line contains two integers $ v $ and $ u $ ( $ 1<=v,u<=n $ , $ v≠u $ ) and a lowercase English letter $ c $ , meaning there's a tunnel connecting junctions $ v $ and $ u $ written $ c $ in it. It is guaranteed that the given graph is a tree. The next $ m $ lines contain the special words. $ i $ -th line of them contains a single string $ s_{i} $ ( $ 1<=|s_{i}|<=10^{5} $ ), consisting of lowercase English letters. It is guaranteed that $ |s_{1}|+|s_{2}|+...+|s_{m}|<=10^{5} $ ). The next $ q $ lines contain the monsters. Each line contains three integers $ i $ , $ j $ and $ k $ ( $ 1<=i,j<=n $ , $ i≠j $ , $ 1<=k<=m $ ), meaning a monster of type $ k $ is going from junction number $ i $ to junction number $ j $ .

输出格式

Print $ q $ lines. $ i $ -th line should contain a single integer, the power the $ i $ -th monster gains after moving.

输入输出样例

输入样例 #1

6 4 5
1 6 b
2 3 a
1 2 b
5 3 b
4 5 b
a
b
bb
aa
1 2 1
6 2 3
1 6 2
4 5 4
1 6 2

输出样例 #1

0
1
1
0
1

输入样例 #2

10 6 7
1 3 s
10 1 d
2 6 s
5 2 d
7 4 l
8 9 d
8 10 l
7 2 d
8 7 l
dl
dssld
d
d
l
sl
4 5 4
3 7 5
10 6 2
3 1 4
7 5 6
10 9 4
9 8 4

输出样例 #2

2
2
0
0
0
1
1

题意翻译

给出一棵 $n$ 个节点的树，每一条边上有一个小写字母。 给定 $m$ 个字符串 $s$。 有 $q$ 组询问，每组询问包含三个数：$i,j,k$，表示如下询问： 以从 $i$ 到 $j$ 的路径上每一条边的字母连接起来所构成的字符串为文本串，$s_k$ 为模式串，求 $s_k$ 在文本串中出现的次数。