//This is real Sp
//Author:Leftist_G / Shunpower
//Cloud Island & Rain Temperature
//May the force be with you and me.
#include <bits/stdc++.h>
#define ET return 0
#define fi first
#define se second
#define mp make_pair
#define pb emplace_back
#define ll long long
#define ull unsigned long long
#define inf INT_MAX
#define uinf INT_MIN
#define pii pair<int,int>
#define pll pair<ll,ll>
#define debug puts("--------Chery AK IOI--------");
#define Yes cout<<"Yes"<<endl;
#define No cout<<"No"<<endl;
#define pt puts("")
#define fr1(i,a,b) for(int i=a;i<=b;i++)
#define fr2(i,a,b) for(int i=a;i>=b;i--)
#define fv(i,p) for(int i=0;i<p.size();i++)
#define ld long double
#define il inline
#define ptc putchar
using namespace std;
const int N=2e5+10;
int n,q;
char s[N];
vector <pii> p[N];
ll dis[N];
int dep[N];
int f[N][19];
int hson[N],top[N],dfn[N];
int lnkn[N];
int tot,tlt;
int LCA(int u,int v){
	if(dep[u]<dep[v]) swap(u,v);
	int k=dep[u]-dep[v];
	fr2(i,18,0){
		if(k>=(1<<i)){
			k-=(1<<i);
			u=f[u][i];
		}
	}
	if(u==v) return u;
	fr2(i,18,0){
		if(f[u][i]!=f[v][i]) u=f[u][i],v=f[v][i];
	}
	return f[u][0];
}
ll dist(int u,int v){
	return dis[u]+dis[v]-2ll*dis[LCA(u,v)];
}
void dfs1(int x,int fa){
	f[x][0]=fa;
	for(auto y:p[x]){
		if(y.fi==fa) continue;
		dep[y.fi]=dep[x]+1;
		dis[y.fi]=dis[x]+y.se;
		hson[x]=y.fi;
		dfs1(y.fi,x);
	}
}
void dfs2(int x,int tp,int fa){
	top[x]=tp;
	tot++;
	dfn[x]=tot;
	if(hson[x]) dfs2(hson[x],tp,x);
	for(auto y:p[x]){
		if(y.fi==fa||hson[x]==y.fi) continue;
		tlt++;
		lnkn[y.fi]=tlt;
		dfs2(y.fi,y.fi,x);
	}
}
#define mid (l+r>>1)
struct info{
	int maxn,minn;
	int nmax,nmin;
};
struct sgtlink{
	info a[N<<2];
	il info pushup(info ls,info rs){
		info ans;
		ans.maxn=max(ls.maxn,rs.maxn);
		ans.minn=min(ls.minn,rs.minn);
		ans.nmax=get<1>(max(tie(ls.maxn,ls.nmax),tie(rs.maxn,rs.nmax)));
		ans.nmin=get<1>(min(tie(ls.minn,ls.nmin),tie(rs.minn,rs.nmin)));
		return ans;
	}
	il void build(int p,int l,int r,int id){
		if(l==r){
			if(s[l]=='1'&&lnkn[top[l]]==id) a[p]={dep[l],dep[l],l,l};
			else a[p]={(int)-1e9,(int)1e9,0,0};
			return;
		}
		build(p<<1,l,mid,id);
		build(p<<1|1,mid+1,r,id);
		a[p]=pushup(a[p<<1],a[p<<1|1]);
	}
	il void flip(int p,int l,int r,int d){
		if(l==r){
			if(s[l]=='1'){
				a[p]={(int)-1e9,(int)1e9,0,0};
				s[l]='0';
			}
			else{
				a[p]={dep[l],dep[l],l,l};
				s[l]='1';
			}
			return;
		}
		if(d<=mid) flip(p<<1,l,mid,d);
		else flip(p<<1|1,mid+1,r,d);
		a[p]=pushup(a[p<<1],a[p<<1|1]);
	}
	il info query(int p,int l,int r,int ml,int mr){
		if(ml<=l&&r<=mr) return a[p];
		if(ml<=mid&&mid<mr) return pushup(query(p<<1,l,mid,ml,mr),query(p<<1|1,mid+1,r,ml,mr));
		else if(ml>mid) return query(p<<1|1,mid+1,r,ml,mr);
		else if(mid>=mr) return query(p<<1,l,mid,ml,mr);
		else throw("ip");
	}
} T[51];
#undef mid
int main(){
#ifdef Shun
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
#endif
	ios::sync_with_stdio(false);
	cin>>n>>q;
	fr1(i,1,n) cin>>s[i];
	fr1(i,2,n){
		int u,v,w;
		cin>>u>>v>>w;
		p[u].pb(mp(v,w)),p[v].pb(mp(u,w));
	}
	dfs1(1,1);
	fr1(j,1,18){
		fr1(i,1,n) f[i][j]=f[f[i][j-1]][j-1];
	}
	tlt++;
	lnkn[1]=tlt;
	dfs2(1,1,1);
	fr1(i,1,tlt) T[i].build(1,1,n,i);
	while(q--){
		int op;
		cin>>op;
		if(op==1){
			int x;
			cin>>x;
			T[lnkn[top[x]]].flip(1,1,n,x);
		}
		else{
			int l,r;
			cin>>l>>r;
			ll ans=0;
			vector <int> keys;
			fr1(i,1,tlt){
				info qry=T[i].query(1,1,n,l,r);
				if(qry.nmax){
					keys.pb(qry.nmax),keys.pb(qry.nmin);
					// cout<<qry.nmax<<" "<<qry.nmin<<endl;
					// ans+=dis[qry.nmax]-dis[qry.nmin];
				}
			}
			if(keys.empty()){
				cout<<"-1\n";
				continue;
			}
			sort(keys.begin(),keys.end(),[](int &x,int &y){
				return dfn[x]<dfn[y];
			});
			// for(auto i:keys) cout<<i<<" ";
			// cout<<endl;
			fr1(i,0,keys.size()-2) ans+=dist(keys[i],keys[i+1]);//cout<<dist(keys[i],keys[i+1])<<" ";
			ans+=dist(keys[0],keys.back());
			cout<<ans<<'\n';
		}
	}
	ET;
}
//ALL FOR Zhang Junhao.