#include <bits/stdc++.h>
#define _rep(i, x, y) for(int i = x; i <= y; ++i)
#define _req(i, x, y) for(int i = x; i >= y; --i)
#define _rev(i, u) for(int i = head[u]; i; i = e[i].nxt)
#define pb push_back
#define fi first
#define se second
#define mst(f, i) memset(f, i, sizeof f)
using namespace std;
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
typedef long long ll;
typedef pair<int, int> PII;
namespace fastio{
    #ifdef ONLINE_JUDGE
    char ibuf[1 << 20],*p1 = ibuf, *p2 = ibuf;
    #define get() p1 == p2 && (p2 = (p1 = ibuf) + fread(ibuf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++
    #else
    #define get() getchar()
    #endif
    template<typename T> inline void read(T &t){
        T x = 0, f = 1;
        char c = getchar();
        while(!isdigit(c)){
            if(c == '-') f = -f;
            c = getchar();
        }
        while(isdigit(c)) x = x * 10 + c - '0', c = getchar();
        t = x * f;
    }
    template<typename T, typename ... Args> inline void read(T &t, Args&... args){
        read(t);
        read(args...);
    }
    template<typename T> void write(T t){
        if(t < 0) putchar('-'), t = -t;
        if(t >= 10) write(t / 10);
        putchar(t % 10 + '0');
    }
    template<typename T, typename ... Args> void write(T t, Args... args){
        write(t), putchar(' '), write(args...);
    }
    template<typename T> void writeln(T t){
        write(t);
        puts("");
    }
    template<typename T> void writes(T t){
        write(t), putchar(' ');
    }
    #undef get
};
using namespace fastio;
#define multitest() int T; read(T); _rep(tCase, 1, T)
namespace Calculation{
    const ll mod = 998244353;
    ll ksm(ll p, ll h){ll base = p % mod, res = 1; while(h){if(h & 1ll) res = res * base % mod; base = base * base % mod, h >>= 1ll;} return res;}
    void dec(ll &x, ll y){x = ((x - y) % mod + mod) % mod;}
    void add(ll &x, ll y){x = (x + y) % mod;}
    void mul(ll &x, ll y){x = x * y % mod;}
    ll sub(ll x, ll y){return ((x - y) % mod + mod) % mod;}
    ll pls(ll x, ll y){return ((x + y) % mod + mod) % mod;}
    ll mult(ll x, ll y){return x * y % mod;}
}
using namespace Calculation;
const int N = 2e5 + 5, inf = 0x3f3f3f3f;
int n, q, id, dfn[N], f[N][25], pre[N], a[N], dep[N];
ll w[N], sum[N];
char s[N];
vector<PII> G[N];
void dfs(int u, int fa){
    f[dfn[u] = ++id][0] = fa;
    for(auto &i : G[u]) if(i.fi != fa) pre[i.fi] = u, dep[i.fi] = dep[u] + 1, dfs(i.fi, u);
    for(auto &i : G[u]) if(i.fi != fa) w[dfn[i.fi]] = i.se;
}
int mindfn(int x, int y){return dfn[x] < dfn[y] ? x : y;}
void buildst(){_rep(i, 1, 20) _rep(j, 1, n - (1 << i) + 1) f[j][i] = mindfn(f[j][i - 1], f[j + (1 << i - 1)][i - 1]);}
int lca(int x, int y){if(x == y) return x; x = dfn[x], y = dfn[y]; if(x > y) swap(x, y); x++; int k = __lg(y - x + 1); return mindfn(f[x][k], f[y - (1 << k) + 1][k]);}
int len, h[N << 1], c[N << 1], bel[N];
bool vis[N];
vector<int> e[N];
void init(){
    int cnt = 0;
    _rep(i, 1, n) if(G[i].size() == 1 || i == 1) c[++cnt] = i;
    sort(c + 1, c + 1 + cnt, [](int x, int y){return dfn[x] < dfn[y];});
    _rep(i, 1, cnt - 1) h[++len] = c[i], h[++len] = lca(c[i], c[i + 1]); h[++len] = c[cnt];
    sort(h + 1, h + 1 + len, [](int x, int y){return dfn[x] < dfn[y];});
    len = unique(h + 1, h + 1 + len) - h - 1;
    _rep(i, 2, len) e[lca(h[i - 1], h[i])].pb(h[i]);
    _rep(i, 1, len) vis[h[i]] = 1;
}
PII operator+(PII x, PII y){return make_pair(min(x.fi, y.fi), max(x.se, y.se));}
struct sgt{
    #define ls x << 1
    #define rs x << 1 | 1
    int p;
    PII tr[N << 2];
    void init(){for(p = 1; p < n + 2; p <<= 1); _rep(i, 1, p + n) tr[i] = {inf, 0};}
    inline void change(int x, int d){
        PII cur = d ? make_pair(dfn[x], dfn[x]) : make_pair(inf, 0);
        for(tr[p + x] = cur, x = p + x >> 1; x > 0; x >>= 1)
            tr[x] = tr[ls] + tr[rs];
    }

    inline PII query(int l, int r){//区间查询最大值
        PII resl = {inf, 0}, resr = {inf, 0};
        for(l = p + l - 1, r = p + r + 1; l ^ 1 ^ r;){
            if(~l & 1) resl = resl + tr[l ^ 1];
            if(r & 1) resr = resr + tr[r ^ 1];
            l >>= 1, r >>= 1;
        }
        return resl + resr;
    }
}tr[105];
int tcnt, tid[N];
ll ans;
int tot, L[N], R[N], g[N];
void solve(int u, int fa){
    int cur = R[u] ? 1 : 0;
    g[u] = cur;
    for(auto &v : e[u]){
        solve(v, u), g[u] += g[v];
    }
    if(g[u]){
        if(g[u] == tot && !cur) return;
        int cl = g[u] == tot ? L[u] + 1 : (fa ? dfn[u] - (dep[u] - dep[fa]) + 1 : dfn[u]);
        int cr = g[u] == cur ? R[u] : dfn[u];
        ans += sum[cr] - sum[cl - 1];
    }
}
int main(){
    read(n, q);
    scanf("%s", s + 1);
    _rep(i, 1, n) a[i] = s[i] - '0';
    _rep(i, 2, n){
        int u, v, w; read(u, v, w);
        G[u].pb({v, w}), G[v].pb({u, w});
    }
    dfs(1, 0); buildst();
    _rep(i, 1, n) sum[i] = sum[i - 1] + w[i];
    init();
    _rep(i, 1, n){
        if(!vis[i]) continue;
        tid[i] = ++tcnt;
        int u = i;
        tr[tid[i]].init();
        do{
            if(a[u]){
                tr[tid[i]].change(u, a[u]);
            }
            bel[u] = i, u = pre[u];
        }while(u && !vis[u]);
    }
    while(q--){
        int opt; read(opt);
        if(opt == 1){
            int x; read(x), a[x] ^= 1;
            tr[tid[bel[x]]].change(x, a[x]);
        }
        if(opt == 2){
            int l, r; read(l, r); tot = ans = 0;
            _rep(i, 1, len){
                g[h[i]] = 0;
                PII now = tr[tid[h[i]]].query(l, r);
                L[h[i]] = now.fi, R[h[i]] = now.se;
                if(R[h[i]]) tot++;
            }
            solve(1, 0);
            writeln(tot ? ans * 2 : -1);
        }
    }
    return 0;
}