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.
import sys

def powc(x,n,m):
  res = 1
  xx=x
  while n:
    if n&1:
      res = (res*xx)%m
    xx=xx*xx%m
    n >>= 1
  return res

def circles(u):
  r = 0
  S = [(u,-1,0)]
  Been = [-1]*n
  Been[u] = 0
  for s in S:
    Visited[s[0]] = 1
    for e in V[s[0]]:
      if e[0] != s[1]:
        if Been[e[0]]==-1: 
          Been[e[0]] = s[2]^e[1]
          S.append((e[0], s[0], s[2]^e[1])) 
        elif Been[e[0]] != s[2]^e[1]:
          return -1
        else:
          r += s[0]<e[0]
  return r

T = int(sys.stdin.readline())
for _ in range(T):
  is_bad = False
  empty = 0
  n,Q = list(map(int, sys.stdin.readline().split()))
  for _ in range(n-1):
    sys.stdin.readline() 
  paths = []
  V=list(map(list,[[]]*n))
  E = []
  for q in range(Q):
    u,v,x = list(map(int, sys.stdin.readline().split()))
    u-=1
    v-=1
    if (v,x^1) in V[u]:
      is_bad = True
    elif (v,x) in V[u]:
      empty += 1
    elif u!=v:
      E.append((u,v,x))
      V[u].append((v,x))
      V[v].append((u,x))
    elif x==1:
      is_bad = True
    else:
      empty += 1
    paths.append((u,v,x))
  if is_bad:
    print(0)
  elif n<=1:
    print(1)
  else:
    Visited = [0]*n
    components = 0
    for i in range(n):
      if Visited[i]==0:
        components += 1
        c = circles(i)
        if c==-1:
          is_bad = True
          break
        empty += c
    if is_bad:
      print(0)
    else:
      print(powc(2,n-1-(Q-empty),10**9+7)) 

import sys

def powc(x,n,m):
  res = 1
  xx=x
  while n:
    if n&1:
      res = (res*xx)%m
    xx=xx*xx%m
    n >>= 1
  return res

def circles(u):
  r = 0
  S = [(u,-1,0)]
  Been = [-1]*n
  Been[u] = 0
  for s in S:
    Visited[s[0]] = 1
    for e in V[s[0]]:
      if e[0] != s[1]:
        if Been[e[0]]==-1: 
          Been[e[0]] = s[2]^e[1]
          S.append((e[0], s[0], s[2]^e[1])) 
        elif Been[e[0]] != s[2]^e[1]:
          return -1
        else:
          r += s[0]<e[0]
  return r

T = int(sys.stdin.readline())
for _ in range(T):
  is_bad = False
  empty = 0
  n,Q = list(map(int, sys.stdin.readline().split()))
  for _ in range(n-1):
    sys.stdin.readline() 
  paths = []
  V=list(map(list,[[]]*n))
  E = []
  for q in range(Q):
    u,v,x = list(map(int, sys.stdin.readline().split()))
    u-=1
    v-=1
    if (v,x^1) in V[u]:
      is_bad = True
    elif (v,x) in V[u]:
      empty += 1
    elif u!=v:
      E.append((u,v,x))
      V[u].append((v,x))
      V[v].append((u,x))
    elif x==1:
      is_bad = True
    else:
      empty += 1
    paths.append((u,v,x))
  if is_bad:
    print(0)
  elif n<=1:
    print(1)
  else:
    Visited = [0]*n
    components = 0
    for i in range(n):
      if Visited[i]==0:
        components += 1
        c = circles(i)
        if c==-1:
          is_bad = True
          break
        empty += c
    if is_bad:
      print(0)
    else:
      print(powc(2,n-1-(Q-empty),10**9+7)) 
