An oriented weighted forest is an acyclic weighted digraph in which from each vertex at most one edge goes.

The root of vertex v of an oriented weighted forest is a vertex from which no edge goes and which can be reached from vertex v moving along the edges of the weighted oriented forest. We denote the root of vertex v as root(v).

The depth of vertex v is the sum of weights of paths passing from the vertex v to its root. Let's denote the depth of the vertex v as depth(v).

Let's consider the process of constructing a weighted directed forest. Initially, the forest does not contain vertices. Vertices are added sequentially one by one. Overall, there are n performed operations of adding. The i-th (i > 0) adding operation is described by a set of numbers (k, v₁, x₁, v₂, x₂, ... , v_k, x_k) and means that we should add vertex number i and k edges to the graph: an edge from vertex root(v₁) to vertex i with weight depth(v₁) + x₁, an edge from vertex root(v₂) to vertex i with weight depth(v₂) + x₂ and so on. If k = 0, then only vertex i is added to the graph, there are no added edges.

Your task is like this: given the operations of adding vertices, calculate the sum of the weights of all edges of the forest, resulting after the application of all defined operations, modulo 1000000007 (10⁹ + 7).

Input

The first line contains a single integer n (1 ≤ n ≤ 10⁵) — the number of operations of adding a vertex.

Next n lines contain descriptions of the operations, the i-th line contains the description of the operation of adding the i-th vertex in the following format: the first number of a line is an integer k (0 ≤ k ≤ i - 1), then follow 2k space-separated integers: v₁, x₁, v₂, x₂, ... , v_k, x_k (1 ≤ v_j ≤ i - 1, |x_j| ≤ 10⁹).

The operations are given in the order, in which they should be applied to the graph. It is guaranteed that sum k of all operations does not exceed 10⁵, also that applying operations of adding vertexes does not result in loops and multiple edges.

Output

Print a single number — the sum of weights of all edges of the resulting graph modulo 1000000007 (10⁹ + 7).

Note

Conside the first sample:

Vertex 1 is added. k = 0, thus no edges are added.
Vertex 2 is added. k = 0, thus no edges are added.
Vertex 3 is added. k = 1. v₁ = 2, x₁ = 1. Edge from vertex root(2) = 2 to vertex 3 with weight depth(2) + x₁ = 0 + 1 = 1 is added.
Vertex 4 is added. k = 2. v₁ = 1, x₁ = 5. Edge from vertex root(1) = 1 to vertex 4 with weight depth(1) + x₁ = 0 + 5 = 5 is added. v₂ = 2, x₂ = 2. Edge from vertex root(2) = 3 to vertex 4 with weight depth(2) + x₁ = 1 + 2 = 3 is added.
Vertex 5 is added. k = 1. v₁ = 1, x₁ = 2. Edge from vertex root(1) = 4 to vertex 5 with weight depth(1) + x₁ = 5 + 2 = 7 is added.
Vertex 6 is added. k = 1. v₁ = 3, x₁ = 4. Edge from vertex root(3) = 5 to vertex 6 with weight depth(3) + x₁ = 10 + 4 = 14 is added.

The resulting graph is shown on the pictore below: $\text{[math]}$

Idx	Name	Rating
A	Let's Watch Football	1000
B	After Training	1300
C	Try and Catch	1800
D	Analyzing Polyline	1900
E	Building Forest	2000

Codeforces Round 123 (Div. 2)