Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

J. Moonwalk challenge

time limit per test

6 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputSince astronauts from BubbleCup XI mission finished their mission on the Moon and are big fans of famous singer, they decided to spend some fun time before returning to the Earth and hence created a so called "Moonwalk challenge" game.

Teams of astronauts are given the map of craters on the Moon and direct bidirectional paths from some craters to others that are safe for "Moonwalking". Each of those direct paths is colored in one color and there is unique path between each two craters. Goal of the game is to find two craters such that given array of colors appears most times as continuous subarray on the path between those two craters (overlapping appearances should be counted).

To help your favorite team win, you should make a program that, given the map, answers the queries of the following type: For two craters and array of colors answer how many times given array appears as continuous subarray on the path from the first crater to the second.

Colors are represented as lowercase English alphabet letters.

Input

In the first line, integer $$$N$$$ $$$(2 \leq N \leq 10^5)$$$ — number of craters on the Moon. Craters are numerated with numbers $$$1$$$ to $$$N$$$.

In next $$$N-1$$$ lines, three values $$$u, v, L$$$ $$$(1 \leq u, v \leq N, L \in \{a, ..., z\})$$$ — denoting that there is a direct path with color $$$L$$$ between craters $$$u$$$ and $$$v$$$.

Next line contains integer $$$Q$$$ $$$(1 \leq Q \leq 10^5)$$$ — number of queries.

Next $$$Q$$$ lines contain three values $$$u, v$$$ $$$(1 \leq u, v \leq N)$$$ and $$$S$$$ $$$(|S| \leq 100)$$$, where $$$u$$$ and $$$v$$$ are the two cratersfor which you should find how many times array of colors $$$S$$$ (represented as string) appears on the path from $$$u$$$ to $$$v$$$.

Output

For each query output one number that represents number of occurrences of array S on the path from $$$u$$$ to $$$v$$$.

Example

Input

6

2 3 g

3 4 n

5 3 o

6 1 n

1 2 d

7

1 6 n

6 4 dg

6 4 n

2 5 og

1 2 d

6 5 go

2 3 g

Output

1

1

2

0

1

1

1

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/26/2019 16:26:46 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|