You are given a directed weighted graph with n nodes and 2n - 2 edges. The nodes are labeled from 1 to n, while the edges are labeled from 1 to 2n - 2. The graph's edges can be split into two parts.

  * The first n - 1 edges will form a rooted spanning tree, with node 1 as the root. All these edges will point away from the root. 
  * The last n - 1 edges will be from node i to node 1, for all 2 ≤ i ≤ n. 



You are given q queries. There are two types of queries

  * 1 i w: Change the weight of the i-th edge to w
  * 2 u v: Print the length of the shortest path between nodes u to v



Given these queries, print the shortest path lengths.

Input

The first line of input will contain two integers n, q (2 ≤ n, q ≤ 200 000), the number of nodes, and the number of queries, respectively.

The next 2n - 2 integers will contain 3 integers ai, bi, ci, denoting a directed edge from node ai to node bi with weight ci.

The first n - 1 of these lines will describe a rooted spanning tree pointing away from node 1, while the last n - 1 of these lines will have bi = 1.

More specifically, 

  * The edges (a1, b1), (a2, b2), ... (an - 1, bn - 1) will describe a rooted spanning tree pointing away from node 1. 
  * bj = 1 for n ≤ j ≤ 2n - 2. 
  * an, an + 1, ..., a2n - 2 will be distinct and between 2 and n. 



The next q lines will contain 3 integers, describing a query in the format described in the statement.

All edge weights will be between 1 and 106.

Output

For each type 2 query, print the length of the shortest path in its own line.

Example

Input

5 9
1 3 1
3 2 2
1 4 3
3 5 4
5 1 5
3 1 6
2 1 7
4 1 8
2 1 1
2 1 3
2 3 5
2 5 2
1 1 100
2 1 3
1 8 30
2 4 2
2 2 4


Output

0
1
4
8
100
132
10
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200005;
const long long inf = 0x3f3f3f3f3f3f3f3f;
int n, q, st[maxn], ed[maxn], cnt, u[maxn << 1], v[maxn << 1];
long long root[maxn], w[maxn << 1];
struct node {
  int l, r;
  long long lazy, mmax;
  void update(long long val) {
    mmax += val;
    lazy += val;
  }
} seg[maxn << 2];
inline void pushup(int x) {
  seg[x].mmax = min(seg[x << 1].mmax, seg[x << 1 | 1].mmax);
}
inline void pushdown(int x) {
  long long lz = seg[x].lazy;
  if (lz) {
    seg[x].lazy = 0;
    seg[x << 1].update(lz);
    seg[x << 1 | 1].update(lz);
  }
}
void build(int x, int l, int r) {
  seg[x].l = l, seg[x].r = r, seg[x].mmax = seg[x].lazy = 0;
  if (l == r) return;
  int m = (l + r) >> 1;
  build(x << 1, l, m);
  build(x << 1 | 1, m + 1, r);
  pushup(x);
}
void update(int x, int l, int r, long long val) {
  int L = seg[x].l, R = seg[x].r;
  if (l <= L && r >= R) {
    seg[x].update(val);
    return;
  }
  pushdown(x);
  int m = (L + R) >> 1;
  if (m >= l) update(x << 1, l, r, val);
  if (m < r) update(x << 1 | 1, l, r, val);
  pushup(x);
}
long long query(int x, int l, int r) {
  int L = seg[x].l, R = seg[x].r;
  if (l <= L && r >= R) return seg[x].mmax;
  pushdown(x);
  int m = (L + R) >> 1;
  long long ret = inf;
  if (m >= l) ret = min(ret, query(x << 1, l, r));
  if (m < r) ret = min(ret, query(x << 1 | 1, l, r));
  pushup(x);
  return ret;
}
vector<int> G[maxn];
void dfs(int u) {
  st[u] = ++cnt;
  for (int i = 0; i < (int)G[u].size(); ++i) dfs(G[u][i]);
  ed[u] = cnt;
}
int main() {
  scanf("%d%d", &n, &q);
  build(1, 1, n);
  for (int i = 1; i <= n - 1; ++i) {
    scanf("%d%d%I64d", &u[i], &v[i], &w[i]);
    G[u[i]].push_back(v[i]);
  }
  dfs(1);
  for (int i = n; i <= 2 * n - 2; ++i) {
    scanf("%d%d%I64d", &u[i], &v[i], &w[i]);
    root[u[i]] = w[i];
    update(1, st[u[i]], st[u[i]], w[i]);
  }
  for (int i = 1; i <= n - 1; ++i) update(1, st[v[i]], ed[v[i]], w[i]);
  while (q--) {
    int ty, a;
    long long b;
    scanf("%d%d%I64d", &ty, &a, &b);
    if (ty == 1) {
      if (a <= n - 1) {
        update(1, st[v[a]], ed[v[a]], b - w[a]);
        w[a] = b;
      } else {
        update(1, st[u[a]], st[u[a]], b - root[u[a]]);
        root[u[a]] = b;
      }
    } else {
      if (st[a] <= st[b] && ed[a] >= ed[b])
        printf("%I64d\n", query(1, st[b], st[b]) - query(1, st[a], st[a]) -
                              root[b] + root[a]);
      else
        printf("%I64d\n", query(1, st[b], st[b]) - root[b] + root[a] -
                              query(1, st[a], st[a]) + query(1, st[a], ed[a]));
    }
  }
  return 0;
}
