#include<bits/stdc++.h>
using namespace std;

#define rep(i,a,b) for(int i=(a),i##end=(b);i<=i##end;++i)
#define per(i,a,b) for(int i=(a),i##end=(b);i>=i##end;--i)
mt19937 Rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
template<typename T>void chkmax(T&x,const T&y){if(x<y)x=y;}
template<typename T>void chkmin(T&x,const T&y){if(y<x)x=y;}

#define pb push_back
#define ALL(x) (x).begin(),(x).end()
#define mem(x) memset((x),0,sizeof(x))

typedef double db;
typedef long long ll;
typedef vector<int>vi;
typedef pair<int,int>pii;

typedef unsigned u32;
typedef unsigned uint;
typedef unsigned long long u64;

namespace orzjk{
  const int SZ=1e6;
  char buf[SZ],*p1=buf,*p2=buf;
  char nc(){
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,SZ,stdin),p1==p2)?EOF:*p1++;
  }
  char fub[SZ],*p3=fub,*p4=fub+SZ;
  void pc(char c){
    p3==p4&&(fwrite(fub,1,SZ,stdout),p3=fub);
    *p3++=c;
  }
  void flush(){
    fwrite(fub,1,p3-fub,stdout),p3=fub;
  }
}
using orzjk::nc;
using orzjk::pc;

//#define nc getchar
//#define pc putchar

int read(){
  int x=0,f=1;char c=nc();
  while(c<48)c=='-'&&(f=-1),c=nc();
  while(c>47)x=x*10+(c^48),c=nc();
  return x*f;
}
template<class T>void write(T x){
  static char st[41];
  if(!x)return pc(48),void();
  char*p=st;
  if(x<0)x=-x,pc('-');
  for(;x;x/=10)*p++=x%10|48;
  do{
    pc(*--p);
  }while(p!=st);
}

//const int P=1e9+7;
const int P=998244353;
int qp(int a,int k){
  int res=1;for(;k;k>>=1,a=1ll*a*a%P)if(k&1)res=1ll*res*a%P;return res;
}

const int maxn=2e5+10;
int n,q;

vector<pii>E[maxn];
ll dis[maxn];
int fa[maxn],dep[maxn],dfn[maxn];
int now,lg[maxn<<1],st[19][maxn<<1];
void dfs1(int u,int f){
  dfn[u]=++now,st[0][now]=u,fa[u]=f,dep[u]=dep[f]+1;
  for(auto[v,w]:E[u])if(v!=f){
    dis[v]=dis[u]+w;
    dfs1(v,u),st[0][++now]=u;
  }
}
int cmp(int u,int v){return dep[u]<dep[v]?u:v;}
void buildst(){
  rep(i,2,now)lg[i]=lg[i>>1]+1;
  rep(i,1,18)rep(j,1,now-(1<<i)+1){
    st[i][j]=cmp(st[i-1][j],st[i-1][j+(1<<(i-1))]);
  }
}
int qlca(int u,int v){
  int l=dfn[u],r=dfn[v];
  if(l>r)swap(l,r);
  int k=lg[r-l+1];
  return cmp(st[k][l],st[k][r-(1<<k)+1]);
}
ll qdis(int u,int v){
  return dis[u]+dis[v]-2*dis[qlca(u,v)];
}

struct node{
  int mn,mx;
};
node operator+(const node&a,const node&b){
  return{min(a.mn,b.mn),max(a.mx,b.mx)};
}
struct sgt{
  int N;
  vector<node>tr;
  void init(int len){
    N=1;
    while(N<len)N<<=1;
    tr=vector<node>(N*2,{now+1,0});
  }
  void upd(int k,node o){
    tr[k+=N-1]=o;
    while(k>>=1)tr[k]=tr[k<<1]+tr[k<<1|1];
  }
  node ask(int l,int r){
    l+=N-1,r+=N-1;
    node res=tr[l]+tr[r];
    while((l^r)>>1){
      if(~l&1)res=res+tr[l^1];
      if(r&1)res=res+tr[r^1];
      l>>=1,r>>=1;
    }
    return res;
  }
};

int tot;
int bl[maxn];
int rk[maxn][105];

sgt tr[105];

bool mark[maxn];
void dfs2(int u,int f){
  int ch=0;
  for(auto[v,w]:E[u])if(v!=f){
    ch++;
  }
  mark[u]=ch!=1;
  if(mark[u]){
    tot++;
    int len=0;
    for(int v=u;(u==v||(v&&!mark[v]));v=fa[v]){
//      printf("#%d : %d\n",v,tot);
      rk[v][tot]=1,bl[v]=tot,len++;
    }
    tr[tot].init(len);
  }
  for(auto[v,w]:E[u])if(v!=f){
    dfs2(v,u);
  }
}

char str[maxn];

void solve(){
  scanf("%d%d%s",&n,&q,str+1);
  rep(i,2,n){
    int u=read(),v=read(),w=read();
    E[u].pb({v,w});
    E[v].pb({u,w});
  }
  dfs1(1,0);
  buildst();
  
  dfs2(1,0);
  rep(i,1,n){
    rep(j,1,tot){
      rk[i][j]+=rk[i-1][j];
    }
  }
  
  vi sta(n+1,0);
  auto upd=[&](int u){
    int i=bl[u];
    if(!sta[u]){
      tr[i].upd(rk[u][i],{dfn[u],dfn[u]});
    }else{
      tr[i].upd(rk[u][i],{now+1,0});
    }
    sta[u]^=1;
  };
  auto ask=[&](int ql,int qr){
    static vi seq;
    seq.clear();
    rep(i,1,tot){
      int l=rk[ql-1][i]+1,r=rk[qr][i];
      if(l<=r){
        node o=tr[i].ask(l,r);
        if(o.mn>now)continue;
        int u=st[0][o.mn],v=st[0][o.mx];
//        printf("@[%d %d] -> [%d %d] : %d : (%d %d) #(%d %d)\n",ql,qr,l,r,i,u,v,dfn[u],dfn[v]);
        seq.pb(u);
        seq.pb(v);
      }
    }
    ll as=0;
    rep(i,0,seq.size()-1)as+=qdis(seq[i],seq[(i+1)%seq.size()]);
    if(seq.empty()){
      as=-1;
    }
    write(as),pc(10);
  };
  
  rep(i,1,n)if(str[i]=='1')upd(i);
  
  while(q--){
    int op=read(),l=read();
    if(op==1){
      upd(l);
    }else{
      int r=read();
      ask(l,r);
    }
  }
}

signed main(){
//  freopen(".in","r",stdin);
//  freopen(".out","w",stdout);
//  int T;cin>>T;while(T--)solve();
  solve();
  orzjk::flush();
  return 0;
}