#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 200000 + 10;
const int INF = 0x3f3f3f3f;
int n, to[MAX_N], back[MAX_N], dep[MAX_N];
int head[MAX_N], tot = 0;
int from[MAX_N * 2], nxt[MAX_N * 2], p[MAX_N], v[MAX_N * 2], w[MAX_N * 2];
void add_edge(int a, int b, int c) {
  tot++;
  nxt[tot] = head[a];
  head[a] = tot;
  from[tot] = a;
  v[tot] = b;
  w[tot] = c;
}
void dfs(int u) {
  for (int i = head[u]; ~i; i = nxt[i]) {
    if (dep[v[i]] > 0) continue;
    dep[v[i]] = dep[u] + 1;
    to[v[i]] = w[i];
    dfs(v[i]);
    back[u] = min(back[u], w[i] + back[v[i]]);
  }
}
void update(int id, int W) {
  to[v[id]] = W;
  int u = from[id];
  w[id] = W;
  int res = INF;
  while (u != 1) {
    for (int i = head[u]; ~i; i = nxt[i]) {
      if (v[i] == 1) res = w[i];
      if (dep[v[i]] < dep[u]) continue;
      res = min(res, back[v[i]] + w[i]);
    }
    if (res == back[u])
      break;
    else {
      back[u] = res;
      u = p[u];
    }
  }
}
int query(int a, int b) {
  int ans = 0;
  if (dep[a] <= dep[b]) {
    while (dep[a] < dep[b]) {
      ans += to[b];
      b = p[b];
    }
    if (a == b) return ans;
  }
  while (b != 1) {
    ans += to[b];
    b = p[b];
  }
  return back[a] + ans;
}
int main() {
  int q;
  scanf("%d%d", &n, &q);
  int a, b, c;
  memset(head, -1, sizeof(head));
  memset(p, -1, sizeof(p));
  memset(back, INF, sizeof(back));
  back[1] = 0;
  dep[1] = 1;
  for (int i = 0; i < n - 1; i++) {
    scanf("%d%d%d", &a, &b, &c);
    p[b] = a;
    add_edge(a, b, c);
  }
  for (int i = 0; i < n - 1; i++) {
    scanf("%d%d%d", &a, &b, &c);
    back[a] = c;
    add_edge(a, b, c);
  }
  dfs(1);
  while (q--) {
    scanf("%d%d%d", &a, &b, &c);
    if (a == 1) {
      update(b, c);
    } else
      printf("%d\n", query(b, c));
  }
  return 0;
}
