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 = 200000 + 10;
const long long INF = (long long)1 << 60;
int n, q, id;
int st[maxn], ed[maxn], head[maxn], path[maxn], idx[maxn];
long long dep[maxn];
long long ad[maxn * 4], mn[maxn * 4];
struct edge {
  int u, v;
  long long w;
  int next;
} Edge[maxn * 2];
void dfs(int u) {
  st[u] = ++id;
  idx[id] = u;
  for (int i = head[u]; i != -1; i = Edge[i].next) {
    dep[Edge[i].v] = dep[u] + Edge[i].w;
    dfs(Edge[i].v);
  }
  ed[u] = id;
}
void push_up(int x) { mn[x] = min(mn[x << 1], mn[x << 1 | 1]); }
void build(int xx, int l, int r) {
  if (l == r) {
    ad[xx] = dep[idx[l]] + Edge[path[idx[l]]].w;
    mn[xx] = ad[xx];
    return;
  }
  int mid = (l + r) >> 1;
  build(xx << 1, l, mid);
  build(xx << 1 | 1, mid + 1, r);
  push_up(xx);
}
void update(int xx, int l, int r, int x, int y, long long v) {
  if (x <= l && r <= y) {
    ad[xx] += v;
    mn[xx] += v;
    return;
  }
  int mid = (l + r) >> 1;
  if (x <= mid) update(xx << 1, l, mid, x, y, v);
  if (mid < y) update(xx << 1 | 1, mid + 1, r, x, y, v);
  push_up(xx);
  mn[xx] += ad[xx];
}
long long query(int xx, int l, int r, int x, long long d) {
  if (l == r) return ad[xx] + d;
  int mid = (l + r) >> 1;
  if (x <= mid)
    return query(xx << 1, l, mid, x, d + ad[xx]);
  else
    return query(xx << 1 | 1, mid + 1, r, x, d + ad[xx]);
}
long long querymn(int xx, int l, int r, int x, int y, long long d) {
  if (x <= l && r <= y) return mn[xx] + d;
  int mid = (l + r) >> 1;
  long long res = INF;
  if (x <= mid) res = min(res, querymn(xx << 1, l, mid, x, y, d + ad[xx]));
  if (mid < y)
    res = min(res, querymn(xx << 1 | 1, mid + 1, r, x, y, d + ad[xx]));
  return res;
}
int main() {
  scanf("%d%d", &n, &q);
  memset(head, -1, sizeof(head));
  for (int i = 1; i <= n - 1; i++) {
    int u, v;
    long long w;
    scanf("%d%d%I64d", &u, &v, &w);
    Edge[i] = {u, v, w, head[u]};
    head[u] = i;
  }
  for (int i = n; i <= 2 * n - 2; i++) {
    int u, v;
    long long w;
    scanf("%d%d%I64d", &u, &v, &w);
    Edge[i] = {u, v, w, -1};
    path[u] = i;
  }
  id = 0;
  dep[1] = 0;
  dfs(1);
  build(1, 1, n);
  while (q--) {
    int op;
    scanf("%d", &op);
    if (op == 1) {
      int x;
      long long w;
      scanf("%d%I64d", &x, &w);
      if (x <= n - 1) {
        int v = Edge[x].v;
        update(1, 1, n, st[v], ed[v], w - Edge[x].w);
      } else {
        int v = Edge[x].u;
        update(1, 1, n, st[v], st[v], w - Edge[x].w);
      }
      Edge[x].w = w;
    } else {
      int u, v;
      scanf("%d%d", &u, &v);
      if (u == v) {
        printf("0\n");
        continue;
      }
      long long du = query(1, 1, n, st[u], 0) - Edge[path[u]].w;
      long long dv = query(1, 1, n, st[v], 0) - Edge[path[v]].w;
      if (st[v] <= ed[u] && st[v] >= st[u])
        printf("%I64d\n", dv - du);
      else {
        long long t = querymn(1, 1, n, st[u], ed[u], 0);
        long long ans = t - du + dv;
        printf("%I64d\n", ans);
      }
    }
  }
  return 0;
}
