#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pir pair<ll,ll>
#define ls first
#define rs second
#define mp make_pair
#define mod 1000000007
#define MAXN 100010
#define qmod(x) (x>mod?x-mod:x)
inline ll read(){
    ll x = 0,f = 1;
    char c = getchar();
    while(c < '0'||c > '9'){
        if(c == '-')f = -1;
        c = getchar();
    }
    while(c >= '0'&&c <= '9'){
        x = x*10+c-'0';
        c = getchar();
    }
    return x*f;
}
// ll dis[MAXN];
ll cnt[10],sum[10],val[MAXN];
ll hd[MAXN],ed[MAXN * 2],nxt[MAXN * 2],c[MAXN * 2];
ll rot,siz_rot,idx,ans,n;
void build(ll x, ll y, ll z){
    ++ idx;
    nxt[idx] = hd[x];
    ed[idx] = y;
    c[idx] = z;
    hd[x] = idx;
}


ll siz[MAXN];
bool vis[MAXN];
void get_rot(ll now, ll fa){
    siz[now] = 1;
    ll u = 0;
    for(int i = hd[now];i;i = nxt[i]){
        ll y = ed[i];
        if(y == fa || vis[y])continue;
        get_rot(y, now);
        siz[now] += siz[y];
        u = max(u, siz[y]);
    }
    // ll siz_v = siz_rot - siz[now];
    u = max(u, siz_rot - siz[now]);
    if(u <= siz_rot >> 1)rot = now;
}


void calc(ll now, ll col, ll dis, ll fa){
    col |= (1 << val[now]);
    for(int i = 0;i <= 7; ++i){
        if((i | col) == 7)ans = (ans + cnt[i] * dis % mod + sum[i]) % mod;
    }
    for(int i = hd[now];i;i = nxt[i]){
        ll y = ed[i];
        if(y == fa || vis[y])continue;
        calc(y, col, dis + c[i], now);
    }
}


void add(ll now, ll col, ll dis, ll fa){
    col |= (1 << val[now]);
    ++ cnt[col];
    sum[col] = qmod(sum[col] + dis);
    for(int i = hd[now];i;i = nxt[i]){
        ll y = ed[i];
        if(y == fa || vis[y])continue;
        add(y, col, dis + c[i], now);
    }
}


void solve(ll now){
    vis[now] = true;
    for(int i = 0;i <= 7; ++i)cnt[i] = sum[i] = 0;
    ++ cnt[1 << val[now]];
    for(int i = hd[now];i;i = nxt[i]){
        ll y = ed[i];
        if(vis[y])continue;
        calc(y, 0, c[i], now);
        add(y, (1 << val[now]), c[i], now);
    }
    get_rot(rot, rot);
    for(int i = hd[now];i;i = nxt[i]){
        ll y = ed[i];
        if(vis[y])continue;
        siz_rot = siz[y];
        rot = 0;
        get_rot(y, now);
        solve(rot);
    }
}


int main(){
    freopen("blossom.in", "r", stdin);
    freopen("blossom.out", "w", stdout);
    n = read();
    for(int i = 1;i <= n; ++i)val[i] = read();
    for(int i = 1;i < n; ++i){
        ll x = read(),y = read(),z = read();
        build(x, y, z);
        build(y, x, z);
    }
    siz_rot = n,rot = 0;
    get_rot(1, 0);
    solve(rot);
    cout << ans;
    return 0;
}