//
// Created by Barichek on 20.07.2023 13:20:07
//

#include <bits/stdc++.h>

#include <algorithm>
#include <cassert>
#include <vector>


#ifdef _MSC_VER
#include <intrin.h>
#endif

namespace atcoder {

namespace internal {

int ceil_pow2(int n) {
    int x = 0;
    while ((1U << x) < (unsigned int)(n)) x++;
    return x;
}

constexpr int bsf_constexpr(unsigned int n) {
    int x = 0;
    while (!(n & (1 << x))) x++;
    return x;
}

int bsf(unsigned int n) {
#ifdef _MSC_VER
    unsigned long index;
    _BitScanForward(&index, n);
    return index;
#else
    return __builtin_ctz(n);
#endif
}

}  // namespace internal

}  // namespace atcoder


namespace atcoder {

template <class S, S (*op)(const S&, const S&), S (*e)()> struct segtree {
  public:
    segtree() : segtree(0) {}
    explicit segtree(int n) : segtree(std::vector<S>(n, e())) {}
    explicit segtree(const std::vector<S>& v) : _n(int(v.size())) {
        log = internal::ceil_pow2(_n);
        size = 1 << log;
        d = std::vector<S>(2 * size, e());
        for (int i = 0; i < _n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) {
            update(i);
        }
    }

    void set(int p, S x) {
        assert(0 <= p && p < _n);
        p += size;
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }

    S get(int p) const {
        assert(0 <= p && p < _n);
        return d[p + size];
    }

    S prod(int l, int r) const {
        assert(0 <= l && l <= r && r <= _n);
        S sml = e(), smr = e();
        l += size;
        r += size;

        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }
        return op(sml, smr);
    }

    S all_prod() const { return d[1]; }

    template <bool (*f)(S)> int max_right(int l) const {
        return max_right(l, [](S x) { return f(x); });
    }
    template <class F> int max_right(int l, F f) const {
        assert(0 <= l && l <= _n);
        assert(f(e()));
        if (l == _n) return _n;
        l += size;
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!f(op(sm, d[l]))) {
                while (l < size) {
                    l = (2 * l);
                    if (f(op(sm, d[l]))) {
                        sm = op(sm, d[l]);
                        l++;
                    }
                }
                return l - size;
            }
            sm = op(sm, d[l]);
            l++;
        } while ((l & -l) != l);
        return _n;
    }

    template <bool (*f)(S)> int min_left(int r) const {
        return min_left(r, [](S x) { return f(x); });
    }
    template <class F> int min_left(int r, F f) const {
        assert(0 <= r && r <= _n);
        assert(f(e()));
        if (r == 0) return 0;
        r += size;
        S sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!f(op(d[r], sm))) {
                while (r < size) {
                    r = (2 * r + 1);
                    if (f(op(d[r], sm))) {
                        sm = op(d[r], sm);
                        r--;
                    }
                }
                return r + 1 - size;
            }
            sm = op(d[r], sm);
        } while ((r & -r) != r);
        return 0;
    }

  private:
    int _n, size, log;
    std::vector<S> d;

    void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
};

}  // namespace atcoder


using namespace std;
using namespace atcoder;

const int max_n = 200222, inf = 1000111222;
const int max_lev = 18;

int ok_sz[max_n], H[max_n], ok_son[max_n];
string s;
vector<int> order, start, fin;

pair<int, int> get_val(int v) {
    if (s[v] == '0') {
        return {-1, -1};
    }
    return {v, v};
}

pair<int, int> merge_p(const pair<int, int> &a, const pair<int, int> &b) {
    if (a.first == -1) {
        return b;
    }
    if (b.first == -1) {
        return a;
    }
    int x = (H[a.first] < H[b.first]) ? a.first : b.first;
    int y = (H[a.second] > H[b.second]) ? a.second : b.second;
    return {x, y};
}

pair<int, int> identity() {
    return {-1, -1};
}

class tree {
public:
    int tin[max_n], tout[max_n];
    long long h[max_n]; // h[root] = 0
    int p[max_lev][max_n];

    void init(int n, vector<pair<int, int>> g[], int root = 0) {
        curt = -1;
        for (int i = 0; i < max_lev; ++i) {
            p[i][root] = root;
        }
        dfs(root, g);
        get_all_p(n);
    }

    bool is_ancestor(int u, int v) const {
        return tin[u] <= tin[v] && tout[u] >= tout[v];
    }

    int lca(int u, int v) const {
        if (is_ancestor(u, v)) {
            return u;
        }
        for (int i = max_lev - 1; i >= 0; --i) {
            if (!is_ancestor(p[i][u], v)) {
                u = p[i][u];
            }
        }
        return p[0][u];
    }

    int get_dist(int u, int v) const {
        const int lc = lca(u, v);
        return h[u] + h[v] - 2 * h[lc];
    }

    int get_up(int v, int dist) const {
        for (int i = max_lev - 1; i >= 0; --i) {
            if (get_bit(dist, i)) {
                v = p[i][v];
            }
        }
        return v;
    }

protected:
    void dfs(int v, vector<pair<int, int>> g[]) {
        tin[v] = ++curt;
        for (auto [to, w] : g[v]) {
            if (to == p[0][v]) {
                continue;
            }
            ++ok_sz[v];
            p[0][to] = v;
            h[to] = h[v] + w;
            H[to] = H[v] + 1;
            ok_son[v] = to;
            dfs(to, g);
        }
        tout[v] = curt;
    }

    void get_all_p(int n) {
        for (int lev = 1; lev < max_lev; ++lev) {
            for (int i = 0; i < n; ++i) {
                p[lev][i] = p[lev - 1][p[lev - 1][i]];
            }
        }
    }

    static bool get_bit(int mask, int pos) {
        return (mask >> pos) & 1;
    }

    int curt;
} t;

long long ans;

vector<int> build_virtual_tree(const tree &t, vector<int> vs) {
    auto cmp_by_tin = [&t](int a, int b) {
        return t.tin[a] < t.tin[b];
    };
    sort(vs.begin(), vs.end(), cmp_by_tin);
    vs.erase(unique(vs.begin(), vs.end()), vs.end());
    for (int i = 0, sz = vs.size(); i + 1 < sz; ++i) {
        vs.push_back(t.lca(vs[i], vs[i + 1]));
    }
    sort(vs.begin(), vs.end(), cmp_by_tin);
    vs.erase(unique(vs.begin(), vs.end()), vs.end());
    const int n = vs.size();
    vector<int> st;
    ans = 0;
    for (int v : vs) {
        while (!st.empty() && !t.is_ancestor(st.back(), v)) {
            st.pop_back();
        }
        if (!st.empty()) {
            ans += abs(t.h[v] - t.h[st.back()]);
        }
        st.push_back(v);
    }
    return vs;
}

int n, q, num_path[max_n];
vector<pair<int, int>> g[max_n];
vector<vector<int>> paths;

int main() {
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> q >> s;
    for (int i = 1; i < n; ++i) {
        int u, v, w;
        cin >> u >> v >> w;
        --u;
        --v;
        g[u].push_back({v, w});
        g[v].push_back({u, w});
    }
    t.init(n, g);
    vector<segtree<pair<int, int>, merge_p, identity>> sts;
    for (int i = 0; i < n; ++i) {
        if (ok_sz[i] == 0) {
            vector<int> path;
            int v = i;
            while (true) {
                path.push_back(v);
                if (!v) {
                    break;
                }
                if (ok_sz[t.p[0][v]] == 1 || ok_son[t.p[0][v]] == v) {
                    v = t.p[0][v];
                } else {
                    break;
                }
            }
            sort(path.begin(), path.end());
            start.push_back(order.size());
            for (int v : path) {
                order.push_back(v);
                num_path[v] = paths.size();
            }
            fin.push_back(order.size() - 1);
            paths.push_back(path);

            vector<pair<int, int>> init(path.size());
            for (int i = 0; i < path.size(); ++i) {
                init[i] = get_val(path[i]);
            }
            sts.emplace_back(init);
        }
    }
    while (q--) {
        int tp;
        cin >> tp;
        if (tp == 1) {
            int x;
            cin >> x;
            --x;
            s[x] ^= '0' ^ '1';
            const int pos = lower_bound(paths[num_path[x]].begin(), paths[num_path[x]].end(), x) - paths[num_path[x]].begin();
            sts[num_path[x]].set(pos, get_val(x));
        } else {
            int l, r;
            cin >> l >> r;
            --l;
            --r;
            vector<int> all;
            for (int i = 0; i < paths.size(); ++i) {
                auto it1 = lower_bound(paths[i].begin(), paths[i].end(), l);
                auto it2 = upper_bound(it1, paths[i].end(), r);
                if (it1 < it2) {
                    auto p = sts[i].prod(it1 - paths[i].begin(), it2 - paths[i].begin());
                    if (p.first != -1) {
                        all.push_back(p.first);
                    }
                    if (p.second != -1) {
                        all.push_back(p.second);
                    }
                }
            }
            if (all.empty()) {
                cout << "-1\n";
                continue;
            }
            build_virtual_tree(t, all);
            cout << 2 * ans << "\n";
        }
    }
    return 0;
}