#include <bits/stdc++.h>
using namespace std;
const int maxn = 233333;
int head[maxn], f[maxn], dis[maxn], dep[maxn], dis2[maxn];
int n, m, x, y, k;
int cnt;
struct edge {
  int fr, next, to, val;
} e[maxn << 1];
void add_edge(int x, int y, int v) {
  e[cnt].to = y;
  e[cnt].next = head[x];
  e[cnt].val = v;
  e[cnt].fr = x;
  head[x] = cnt++;
}
void update(int id, int k) {
  int v = e[id].fr;
  if (id < n) {
    dis2[e[id].to] = k;
  }
  e[id].val = k;
  int tmp = 0x3f3f3f3f;
  while (v != 1) {
    for (int i = head[v]; ~i; i = e[i].next) {
      int w = e[i].to;
      if (w == 1) tmp = e[i].val;
      if (dep[w] < dep[v]) continue;
      tmp = min(tmp, dis[w] + e[i].val);
    }
    if (tmp == dis[v])
      break;
    else {
      dis[v] = tmp;
      v = f[v];
    }
  }
}
void dfs(int u) {
  for (int i = head[u]; ~i; i = e[i].next) {
    int v = e[i].to;
    if (dep[v] > 0) continue;
    dep[v] = dep[u] + 1;
    dis2[v] = e[i].val;
    dfs(v);
    dis[u] = min(dis[u], dis[v] + e[i].val);
  }
}
int query(int x, int y) {
  int ans = 0;
  int v = y;
  if (dep[x] <= dep[y]) {
    while (dep[x] < dep[v]) {
      ans += dis2[v];
      v = f[v];
    }
    if (x == v) {
      return ans;
    }
  }
  while (v != 1) {
    ans += dis2[v];
    v = f[v];
  }
  return dis[x] + ans;
}
int main() {
  cnt = 1;
  cin >> n >> m;
  memset(dis, 0x3f, sizeof dis);
  memset(dep, -1, sizeof dep);
  memset(head, -1, sizeof head);
  dis[1] = 0;
  dep[1] = 1;
  for (int i = 0; i < n - 1; i++) {
    scanf("%d%d%d", &x, &y, &k);
    f[y] = x;
    add_edge(x, y, k);
  }
  for (int i = 0; i < n - 1; i++) {
    scanf("%d%d%d", &x, &y, &k);
    dis[x] = k;
    add_edge(x, y, k);
  }
  dfs(1);
  for (int i = 0; i < m; i++) {
    scanf("%d%d%d", &k, &x, &y);
    if (k == 1)
      update(x, y);
    else
      printf("%d\n", query(x, y));
  }
}
