/*input
3
1 2 50
2 3 59
4
24 41 93
10 66 43
4
88 28 41
4 30 13
5
4 10 61 100
70 58 34 79
*/
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
//#pragma GCC target("avx2")
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll maxn=4e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-4;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?"\n":"");
    return out;
}
ll mult(ll a,ll b){
    return a*b%MOD;
}
ll mypow(ll a,ll b){
    a%=MOD;
    if(a==0) return 0;
    if(b<=0) return 1;
    ll res=1LL;  
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
vector<pii> v[maxn];
vector<ll> l[maxn],c[maxn];
ll pf[maxn],p2[maxn],ppf[maxn];
int m;
ll get(int a,int b){
    return pf[b]-pf[a];
}
int st[maxn];
ll ans=0;
int tot=0;
void dfs(int u,int p){
    for(auto x:v[u]){
        if(x.f==p) continue;
        dfs(x.f,u);
        st[u]+=st[x.f];
        ans+=2LL*st[x.f]*(tot-st[x.f])%MOD*x.s%MOD;
        ans%=MOD;
    }
}
int main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n;
    cin>>n;
    REP(i,n-1){
        int a,b,c;
        cin>>a>>b>>c;
        --a,--b;
        v[a].pb({b,c}),v[b].pb({a,c});
    }
    REP(i,n){
        cin>>m;
        --m;
        tot+=m;
        st[i]=m;
        l[i].resize(2*m),c[i].resize(2*m);
        REP(j,m){
            cin>>l[i][j];
            l[i][j+m]=l[i][j];
        }
        REP(j,m){
            cin>>c[i][j];
            c[i][j+m]=c[i][j];
        }
        REP1(j,2*m-1){
            pf[j]=pf[j-1]+l[i][j-1];
            ppf[j]=(ppf[j-1]+pf[j])%MOD;
            MNTO(c[i][j],c[i][j-1]+l[i][j-1]);
        }
        for(int j=2*m-2;j>=0;j--){
            MNTO(c[i][j],c[i][j+1]+l[i][j]);
        }
        REP(j,m) MNTO(c[i][j],c[i][j+m]),MNTO(c[i][j+m],c[i][j]);
        p2[0]=c[i][0];
        REP1(j,2*m-1){
            p2[j]=p2[j-1]+c[i][j];
        }
        REP(j,m){
            int a=j,b=j+m-1;
            while(a<b){
                int mid=(a+b+1)/2;
                if(get(j,mid)<c[i][j]+c[i][mid]){
                    a=mid;
                }
                else b=mid-1;
            }
            int opl=a;
            a=j+1,b=j+m;
            while(a<b){
                int mid=(a+b)/2;
                if(get(mid,j+m)<c[i][j]+c[i][mid]){
                    b=mid;
                }
                else a=mid+1;
            }
            int opr=a;
            if(opl<opr){
                ans+=p2[opr-1]-p2[opl]+1LL*(opr-opl-1)*c[i][j];
                ans+=(ppf[opl]-ppf[j])-1LL*(opl-j)*(pf[j]%MOD)%MOD;
                ans+=pf[j+m]%MOD*(j+m-opr)%MOD-(ppf[j+m-1]-ppf[opr-1]);
            }
            else{
                a=j,b=j+m;
                while(a<b){
                    int mid=(a+b+1)/2;
                    if(get(j,mid)<get(mid,j+m)){
                        a=mid;
                    }
                    else b=mid-1;
                }
                ans+=(ppf[a]-ppf[j])-1LL*(a-j)*(pf[j]%MOD)%MOD;
                ++a;
                ans+=1LL*(pf[j+m]%MOD)*(j+m-a)%MOD-(ppf[j+m-1]-ppf[a-1]);
            }
            ans%=MOD;
            if(ans<0) ans+=MOD;
        }
        ans%=MOD;
    }
    REP(i,n){
        int m=sz(c[i])/2;
        REP(j,m) ans+=2LL*c[i][j]*(tot-m)%MOD;
        ans%=MOD;
    }
    dfs(0,-1);
    cout<<ans<<'\n';
}