1```c
2#include <stdio.h>
3#include <stdlib.h>
4#include <string.h>
5
6#define MAX 50001











```

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int dfs(int u, const vector<vector<int>>& adj, vector<int>& dp, const vector<int>& time) {
    if (dp[u] != 0) return dp[u];
    dp[u] = time[u - 1];
    for (int v : adj[u]) {
        dp[u] = max(dp[u], dfs(v, adj, dp, time) + time[u - 1]);
    }
    return dp[u];
}

int minTimeDFS(int n, vector<vector<int>>& relations, vector<int>& time) {
    vector<vector<int>> adj(n + 1);
    for (const auto& rel : relations) {
        adj[rel[0]].push_back(rel[1]);
    }

    vector<int> dp(n + 1, 0);
    int maxTime = 0;
    for (int i = 1; i <= n; ++i) {
        maxTime = max(maxTime, dfs(i, adj, dp, time));
    }

    return maxTime;
}

int main() {
    int n = 5;
    vector<vector<int>> relations = {{1,5},{2,5},{3,5},{3,4},{4,5}};
    vector<int> time = {1, 2, 3, 4, 5};
    cout << minTimeDFS(n, relations, time) << endl;
    return 0;
}
```