#include "escape_route.h"
#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<x.F<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
const int N=101;
int n,m,vis[N];
ll t,P;
pair<ll,ll> dist[N];
vector<pair<int,pair<ll,ll>>> g[N];
vector<ll> calculate_necessary_time(int _n,int _m,ll _P,int Q,vector<int> A,vector<int> B,vector<ll> L,vector<ll> C,vector<int> U,vector<int> V,vector<ll> T){
n=_n,m=_m,P=_P;
vector<ll> ans(Q);
f(i,0,m){
g[A[i]].pb({B[i],{C[i]-L[i],L[i]}});
g[B[i]].pb({A[i],{C[i]-L[i],L[i]}});
}
f(C,0,U.size()){
int u=U[C],v=V[C];
ll t=T[C];
f(i,0,n) vis[i]=0,dist[i]={N,0};
dist[u]={0,t};
f(T,0,n){
int id=-1;
f(i,0,n){
if(vis[i]==0 && (id==-1 || dist[i]<dist[id])){
id=i;
}
}
vis[id]=1;
f(i,0,g[id].size()){
int nxt=g[id][i].F,c=g[id][i].S.F;
ll l=g[id][i].S.S;
if(dist[id].S<=c){
minm(dist[nxt],mp(dist[id].F,dist[id].S+l));
}
else{
minm(dist[nxt],mp(dist[id].F+1,l));
}
}
}
ans[C]=P*dist[v].F+dist[v].S-t;
}
return ans;
}
