#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


// T: monoid representing information of an interval.
//   T()  should return the identity.
//   T(S s)  should represent a single element of the array.
//   T::pull(const T &l, const T &r)  should pull two intervals.
template <class T> struct SegmentTreePoint {
  int logN, n;
  vector<T> ts;
  SegmentTreePoint() {}
  explicit SegmentTreePoint(int n_) {
    for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}
    ts.resize(n << 1);
  }
  template <class S> explicit SegmentTreePoint(const vector<S> &ss) {
    const int n_ = ss.size();
    for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}
    ts.resize(n << 1);
    for (int i = 0; i < n_; ++i) at(i) = T(ss[i]);
    build();
  }
  T &at(int i) {
    return ts[n + i];
  }
  void build() {
    for (int u = n; --u; ) pull(u);
  }

  inline void pull(int u) {
    ts[u].pull(ts[u << 1], ts[u << 1 | 1]);
  }

  // Changes the value of point a to s.
  template <class S> void change(int a, const S &s) {
    assert(0 <= a); assert(a < n);
    ts[a += n] = T(s);
    for (; a >>= 1; ) pull(a);
  }

  // Applies T::f(args...) to point a.
  template <class F, class... Args>
  void ch(int a, F f, Args &&... args) {
    assert(0 <= a); assert(a < n);
    (ts[a += n].*f)(args...);
    for (; a >>= 1; ) pull(a);
  }

  // Calculates the product for [a, b).
  T get(int a, int b) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return T();
    a += n; b += n;
    T prodL, prodR, t;
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) { t.pull(prodL, ts[aa++]); prodL = t; }
      if (bb & 1) { t.pull(ts[--bb], prodR); prodR = t; }
    }
    t.pull(prodL, prodR);
    return t;
  }

  // Calculates T::f(args...) of a monoid type for [a, b).
  //   op(-, -)  should calculate the product.
  //   e()  should return the identity.
  template <class Op, class E, class F, class... Args>
#if __cplusplus >= 201402L
  auto
#else
  decltype((std::declval<T>().*F())())
#endif
  get(int a, int b, Op op, E e, F f, Args &&... args) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return e();
    a += n; b += n;
    auto prodL = e(), prodR = e();
    for (int aa = a, bb = b; aa < bb; aa >>= 1, bb >>= 1) {
      if (aa & 1) prodL = op(prodL, (ts[aa++].*f)(args...));
      if (bb & 1) prodR = op((ts[--bb].*f)(args...), prodR);
    }
    return op(prodL, prodR);
  }

  // Find min b s.t. T::f(args...) returns true,
  // when called for the partition of [a, b) from left to right.
  //   Returns n + 1 if there is no such b.
  template <class F, class... Args>
  int findRight(int a, F f, Args &&... args) {
    assert(0 <= a); assert(a <= n);
    if ((T().*f)(args...)) return a;
    if (a == n) return n + 1;
    a += n;
    for (; ; a >>= 1) if (a & 1) {
      if ((ts[a].*f)(args...)) {
        for (; a < n; ) {
          if (!(ts[a <<= 1].*f)(args...)) ++a;
        }
        return a - n + 1;
      }
      ++a;
      if (!(a & (a - 1))) return n + 1;
    }
  }

  // Find max a s.t. T::f(args...) returns true,
  // when called for the partition of [a, b) from right to left.
  //   Returns -1 if there is no such a.
  template <class F, class... Args>
  int findLeft(int b, F f, Args &&... args) {
    assert(0 <= b); assert(b <= n);
    if ((T().*f)(args...)) return b;
    if (b == 0) return -1;
    b += n;
    for (; ; b >>= 1) if ((b & 1) || b == 2) {
      if ((ts[b - 1].*f)(args...)) {
        for (; b <= n; ) {
          if (!(ts[(b <<= 1) - 1].*f)(args...)) --b;
        }
        return b - n - 1;
      }
      --b;
      if (!(b & (b - 1))) return -1;
    }
  }
};

////////////////////////////////////////////////////////////////////////////////

constexpr int INF = 1001001001;

struct Node {
  pair<int, int> mn, mx;
  Node() : mn(+INF, -1), mx(-INF, -1) {}
  Node(const pair<int, int> &val) : mn(val), mx(val) {}
  void pull(const Node &l, const Node &r) {
    mn = min(l.mn, r.mn);
    mx = max(l.mx, r.mx);
  }
};

////////////////////////////////////////////////////////////////////////////////


int N, Q;
char S[200'010];
vector<int> A, B;
vector<Int> C;

vector<vector<int>> G;
vector<int> dep, dis, fin;
vector<int> seq;

int H;
vector<int> head;
vector<Int> cs;

void dfs(int u, int p, int h) {
  dep[u] = ~p ? (dep[p] + 1) : 0;
  dis[u] = seq.size();
  seq.push_back(u);
  
  head[u] = h;
  int deg = 0;
  for (const int i : G[u]) {
    const int v = A[i] ^ B[i] ^ u;
    if (p != v) {
      ++deg;
    }
  }
  
  for (const int i : G[u]) {
    const int v = A[i] ^ B[i] ^ u;
    if (p != v) {
      cs[v] = cs[u] + C[i];
      dfs(v, u, (deg >= 2) ? H++ : h);
      seq.push_back(u);
    }
  }
}

// [bsr(2 N - 1) + 1][2 N - 1]
int E;
int mns[19][400'010];
int shallower(int u, int v) {
  return (dep[u] <= dep[v]) ? u : v;
}
int lca(int u, int v) {
  int j0 = dis[u], j1 = dis[v];
  if (j0 > j1) swap(j0, j1);
  ++j1;
  const int e = 31 - __builtin_clz(j1 - j0);
  return shallower(mns[e][j0], mns[e][j1 - (1 << e)]);
}

Int getDist(int u, int v) {
  const int l = lca(u, v);
  return cs[u] + cs[v] - 2 * cs[l];
}

int main() {
  for (; ~scanf("%d%d", &N, &Q); ) {
    scanf("%s", S);
    A.resize(N - 1);
    B.resize(N - 1);
    C.resize(N - 1);
    for (int i = 0; i < N - 1; ++i) {
      scanf("%d%d%lld", &A[i], &B[i], &C[i]);
      --A[i];
      --B[i];
    }
    
    G.assign(N, {});
    for (int i = 0; i < N - 1; ++i) {
      G[A[i]].push_back(i);
      G[B[i]].push_back(i);
    }
    dep.resize(N);
    dis.resize(N);
    fin.resize(N);
    seq.clear();
    
    H = 1;
    head.resize(N);
    cs.assign(N, 0);
    dfs(0, -1, 0);
    
    E = (31 - __builtin_clz(2 * N - 1)) + 1;
    for (int j = 0; j < 2 * N - 1; ++j) {
      mns[0][j] = seq[j];
    }
    for (int e = 0; e < E - 1; ++e) {
      for (int i = 0; i + (1 << (e + 1)) <= 2 * N - 1; ++i) {
        mns[e + 1][i] = shallower(mns[e][i], mns[e][i + (1 << e)]);
      }
    }
// cerr<<"head = "<<head<<endl;
// cerr<<"cs = "<<cs<<endl;
    
    vector<vector<int>> uss(H);
    for (int u = 0; u < N; ++u) {
      uss[head[u]].push_back(u);
    }
    vector<vector<int>> idss(H, vector<int>(N + 1, -1));
    vector<SegmentTreePoint<Node>> segs(H);
    for (int h = 0; h < H; ++h) {
      const auto &us = uss[h];
      const int usLen = us.size();
      for (int j = 0; j <= usLen; ++j) {
        const int uL = (j == 0) ? 0 : (us[j - 1] + 1);
        const int uR = (j == usLen) ? (N + 1) : (us[j] + 1);
        fill(idss[h].begin() + uL, idss[h].begin() + uR, j);
      }
      segs[h] = SegmentTreePoint<Node>(usLen);
    }
    
    auto add = [&](int u) -> void {
// cerr<<"add "<<u<<endl;
      const int h = head[u];
      segs[head[u]].change(idss[h][u], make_pair(dep[u], u));
    };
    auto rem = [&](int u) -> void {
// cerr<<"rem "<<u<<endl;
      const int h = head[u];
      segs[head[u]].change(idss[h][u], Node());
    };
    
    for (int u = 0; u < N; ++u) if (S[u] == '1') {
      add(u);
    }
    
    for (; Q--; ) {
      int typ;
      scanf("%d", &typ);
      if (typ == 1) {
        int u;
        scanf("%d", &u);
        --u;
        
        S[u] ^= '0' ^ '1';
        (S[u] == '1') ? add(u) : rem(u);
      } else {
        int l, r;
        scanf("%d%d", &l, &r);
        --l;
        
        vector<int> us;
        us.reserve(2 * H);
        for (int h = 0; h < H; ++h) {
          const auto res = segs[h].get(idss[h][l], idss[h][r]);
          for (const int u : {res.mn.second, res.mx.second}) if (~u) {
            us.push_back(u);
          }
        }
        const int usLen = us.size();
        /*
        sort(us.begin(), us.end(), [&](int u, int v) -> bool {
          return (dis[u] < dis[v]);
        });
        */
        Int ans;
        if (usLen != 0) {
          ans = 0;
          for (int j = 0; j < usLen; ++j) {
            ans += getDist(us[j], us[(j + 1 == usLen) ? 0 : (j + 1)]);
          }
        } else {
          ans = -1;
        }
        printf("%lld\n", ans);
      }
    }
  }
  return 0;
}