پستint minimumWeight(int n, vector<vector<int>>& edges, int C1, int C2) {

int minimumWeight(int n, vector<vector<int>>& edges, int C1, int C2) { vector<long long> A(n,LLONG_MAX), B(n,LLONG_MAX); Dijkstra(C1,graph,A); Dijkstra(C2,graph,B); int node=0 , dist=LLONG_MAX; for(int i=0;i<=n-1;i++){ if(A[i]==LLONG_MAX || B[i]==LLONG_MAX) continue; if(dist>A[i]+B[i]){ dist= A[i]+B[i]; node=i; } } return node; }