You are given a tree consisting of n nodes numbered from 1 to n. The weights of edges of the tree can be any binary integer satisfying following Q conditions.

- 
		Each condition is of form u, v, x where u, v are nodes of the tree and x is a binary number. 

		For satisfying this condition,  sum of the weight of all the edges present in the path from node u to v of the tree, should have even if x = 0, odd otherwise. 
	

Now, you have to find out number of ways of assigning 0/1 (binary) weights to the edges of the tree satisfying the above conditions.
As the answer could be quite large, print your answer modulo 109 + 7.

-----Input-----
- The first line of input contains a single integer T denoting number of test cases.
- For each test case:
	
- First line contains two space separated integers n, Q.
- Each of the next n - 1 lines will contain two space separated integer  u, v denoting that there is an edge between vertex u and v in the tree.
- Each of the next Q lines will contain three space separated integer  u, v, x denoting a condition as stated in the probelm.

-----Output-----
- For each test case, output a single integer corresponding to the answer of the problem.

-----Constraints-----
- 1 ≤ u, v ≤ n
- 0 ≤ x ≤ 1

-----Subtasks-----
Subtask #1 : (10 points)
- Sum of each of variables n and Q over all the test cases ≤ 20

Subtask #2 : (20 points)
- Sum of each of variables n and Q over all the test cases ≤ 100

Subtask #3 : (30 points)
- Sum of each of variables n and Q over all the test cases ≤ 5000

Subtask #4 : (40 points)
- Sum of each of variables n and Q over all the test cases ≤ 100000

-----Example-----
Input:
3
3 2
1 2
1 3
1 2 0
1 3 0
3 0
1 2
2 3
3 1
1 2
2 3
1 2 1

Output:
1
4
2

-----Explanation-----
In the first example, 
You can only set the weight of each edge equal to 0 for satisfying the given condition. So, there is exactly one way of doing this. Hence answer is 1.

In the second example, 
There are two edges and there is no condition on the edges. So, you can assign them in 4 ways. 

In the third example, 
You have to assign the weight of edge between node 1 and 2 to 1. You can assign the remaining edge from 2 to 3 either 0 or 1. So, the answer is 2.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'import sys\n\ndef powc(x,n,m):\n  res = 1\n  xx=x\n  while n:\n    if n&1:\n      res = (res*xx)%m\n    xx=xx*xx%m\n    n >>= 1\n  return res\n\ndef circles(u):\n  r = 0\n  S = [(u,-1,0)]\n  Been = [-1]*n\n  for s in S:\n    if Been[s[0]]!=-1:\n      if Been[s[0]][1] != s[2]:\n        return -1\n      r += 1\n      continue\n    Been[s[0]] = (0,s[2])\n    Visited[s[0]] = 1\n    for e in V[s[0]]:\n      if e[0] != s[1]:\n        if Been[e[0]]==-1: \n          S.append((e[0], s[0], s[2]^e[1])) \n  return r\n\nT = int(sys.stdin.readline())\nfor _ in range(T):\n  is_bad = False\n  empty = 0\n  n,Q = list(map(int, sys.stdin.readline().split()))\n  for _ in range(n-1):\n    sys.stdin.readline() \n  paths = []\n  V=list(map(list,[[]]*n))\n  E = []\n  for q in range(Q):\n    u,v,x = list(map(int, sys.stdin.readline().split()))\n    u-=1\n    v-=1\n    if (v,x^1) in V[u]:\n      is_bad = True\n    elif (v,x) in V[u]:\n      empty += 1\n    elif u!=v:\n      E.append((u,v,x))\n      V[u].append((v,x))\n      V[v].append((u,x))\n    elif x==1:\n      is_bad = True\n    else:\n      empty += 1\n    paths.append((u,v,x))\n  if is_bad:\n    print(0)\n  elif n<=1:\n    print(1)\n  else:\n    Visited = [0]*n\n    components = 0\n    for i in range(n):\n      if Visited[i]==0:\n        components += 1\n        c = circles(i)\n        if c==-1:\n          is_bad = True\n          break\n        empty += c\n    if is_bad:\n      print(0)\n    else:\n      print(powc(2,n-1-(Q-empty),10**9+7)) \n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 14319