#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define pii pair<int, int>
#define ld long double
#define all(a) (a).begin(), (a).end()

const int INF = 1e9;

pair<int, int> combine(const pair<int, int>& a, const pair<int, int>& b) {
    return make_pair(min(a.first, b.first), max(a.second, b.second));
}

struct Tree {
    vector<int> ids;
    vector<int> mns;
    vector<int> mxs;
    int N;
    void init(const vector<int>& _ids) {
        ids = _ids;
        N = 1;
        while (N < ids.size())
            N *= 2;
        mns.resize(2 * N, INF);
        mxs.resize(2 * N, -INF);
    }
    void reset(int i) {
        i += N;
        if (mns[i] == INF) {
            mns[i] = ids[i - N];
            mxs[i] = ids[i - N];
        } else {
            mns[i] = INF;
            mxs[i] = -INF;
        }
        while (i > 1) {
            i >>= 1;
            mns[i] = min(mns[2 * i], mns[2 * i + 1]);
            mxs[i] = max(mxs[2 * i], mxs[2 * i + 1]);
        }
    }
    pair<int, int> get(int x, int y) {
        x += N;
        y += N - 1;
        pair<int, int> ans(INF, -INF);
        while (x <= y) {
            if (x & 1) {
                ans.first = min(ans.first, mns[x]);
                ans.second = max(ans.second, mxs[x]);
            }
            if (!(y & 1)) {
                ans.first = min(ans.first, mns[y]);
                ans.second = max(ans.second, mxs[y]);
            }
            x = (x + 1) >> 1;
            y = (y - 1) >> 1;
        }
        return ans;
    }
};

const int MAXN = 200200;
vector<pair<int, int>> G[MAXN];
vector<int> paths_v[MAXN];
vector<long long> paths_pref[MAXN];
int path_cnt = 0;

void dfs(int v, int p, int path_id) {
    if (G[v].size() > 2) {
        for (auto [u, w] : G[v]) {
            if (u == p)
                continue;
            int cur_path = path_cnt;
            ++path_cnt;
            paths_v[cur_path].emplace_back(v);
            paths_pref[cur_path].emplace_back(0);
            paths_v[cur_path].emplace_back(u);
            paths_pref[cur_path].emplace_back(w);
            dfs(u, v, cur_path);
        }
    } else {
        for (auto [u, w] : G[v]) {
            if (u == p)
                continue;
            paths_v[path_id].emplace_back(u);
            paths_pref[path_id].push_back(paths_pref[path_id].back() + w);
            dfs(u, v, path_id);
        }
    }
}


vector<int> sorted_v[MAXN];
const int MAXK = 100;
int indices[MAXK][MAXN];
int first_at_least[MAXK][MAXN];
Tree trees[MAXK];

pair<int, int> segms[MAXK];
const pair<int, int> NONE(INF, -INF);
vector<pair<int, int>> G2[MAXN];

pair<long long, long long> go_dfs(int v, int p) {
    long long dist_to = -1;
    long long sum = 0;
    for (auto [u, id] : G2[v]) {
        if (id == p)
            continue;
        auto tmp = go_dfs(u, id);
        if (segms[id] == NONE && tmp.first == -1)
            continue;
        long long dist_to1 = 0;
        long long sum1 = 0;
        if (segms[id] != NONE) {
            dist_to1 = paths_pref[id][segms[id].first];
            sum1 += paths_pref[id][segms[id].second] - paths_pref[id][segms[id].first];
            if (tmp.first != -1) {
                sum1 += paths_pref[id].back() - paths_pref[id][segms[id].second];
                sum1 += tmp.first + tmp.second;
            }
        } else {
            dist_to1 = paths_pref[id].back() + tmp.first;
            sum1 = tmp.second;
        }
        sum += sum1;
        if (dist_to == -1) {
            dist_to = dist_to1;
        } else {
            sum += dist_to + dist_to1;
            dist_to = 0;
        }
    }
    //cout << v << ' ' << dist_to << ' ' << sum << '\n';
    return make_pair(dist_to, sum);
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n, q;
    cin >> n >> q;
    string s;
    cin >> s;
    for (int i = 1; i < n; ++i) {
        int a, b, c;
        cin >> a >> b >> c;
        G[a - 1].emplace_back(b - 1, c);
        G[b - 1].emplace_back(a - 1, c);
    }
    int root = 0;
    while (n != 1 && G[root].size() != 1)
        ++root;
    ++path_cnt;
    paths_v[0].emplace_back(root);
    paths_pref[0].emplace_back(0);
    dfs(root, -1, 0);
    int K = path_cnt;
    for (int i = 0; i < K; ++i) {
        fill(indices[i], indices[i] + n, -1);
        sorted_v[i] = paths_v[i];
        sort(sorted_v[i].begin(), sorted_v[i].end());
        for (int j = 0; j < sorted_v[i].size(); ++j)
            indices[i][sorted_v[i][j]] = j;
        first_at_least[i][n] = sorted_v[i].size();
        for (int j = n - 1; j >= 0; --j) {
            first_at_least[i][j] = indices[i][j] == -1 ? first_at_least[i][j + 1] : indices[i][j];
        }
        G2[paths_v[i][0]].emplace_back(paths_v[i].back(), i);
        G2[paths_v[i].back()].emplace_back(paths_v[i][0], i);
        map<int, int> kek;
        for (int j = 0; j < paths_v[i].size(); ++j) {
            kek[paths_v[i][j]] = j;
        }
        vector<int> cur_ind(paths_v[i].size());
        for (int j = 0; j < sorted_v[i].size(); ++j) {
            cur_ind[j] = kek[sorted_v[i][j]];
        }
        trees[i].init(cur_ind);


        /*cout << "path " << i << ": ";
        for (int v : paths_v[i])
            cout << v << ' ';
        cout << '\n';*/
    }
    for (int i = 0; i < n; ++i) {
        if (s[i] == '1') {
            for (int j = 0; j < K; ++j) {
                if (indices[j][i] != -1)
                    trees[j].reset(indices[j][i]);
            }
        }
    }
    while (q--) {
        int t;
        cin >> t;
        if (t == 1) {
            int i;
            cin >> i;
            --i;
            for (int j = 0; j < K; ++j) {
                if (indices[j][i] != -1)
                    trees[j].reset(indices[j][i]);
            }
        } else {
            int l, r;
            cin >> l >> r;
            --l;
            for (int j = 0; j < K; ++j) {
                segms[j] = trees[j].get(first_at_least[j][l], first_at_least[j][r]);
            }
            auto tmp = go_dfs(root, -1);
            //cout << tmp.first << ',' << tmp.second << '\n';
            if (tmp.first == -1)
                cout << -1 << '\n';
            else
                cout << 2 * tmp.second << '\n';
        }
    }
    return 0;
}