A binary tree and a number k are given. Print the count of every path in the tree with sum of the nodes in the path as k.

**Input:**

First line consists of T test cases. First line of every test case consists of N, denoting the number of Node is Binary tree. Second line consists of N spaced 3 elements denoting the Parent node, Child Node and a character denoting left or right child. Third line of every test case consists of a integer K.

**Output:**

Return the Count of number of paths in tree.

**Constraints:**

1<=T<=20

1<=N<=100

**Example:
Input:**

1

4

1 3 L 3 2 L 3 -1 R -1 1 R

4

2

Ibrahim Nash | 107 |

aristotle | 79 |

Stark_Maverick | 77 |

shankyy | 73 |

Lam Ngoc Pham | 71 |

Lam Ngoc Pham | 476 |

All Is Well | 399 |

Prateek Gole | 385 |

Divvya Sinha | 374 |

Ibrahim Nash | 347 |

akhayrutdinov | 3868 |

sanjay05 | 3366 |

Michael Riegger | 2033 |

Jasleen Kaur 2 | 2012 |

Quandray | 1982 |