1```cpp
2#include <iostream>
3#include <vector>
4#include <queue>
5#include <algorithm>
6
7using namespace std;
8
9int minTime(int n, vector<vector<int>>& relations, vector<int>& time) {
10    vector<int> adj[n+1];
11    vector<int> indegree(n+1, 0);
12    vector<int> dp(n+1, 0);
13    for (const auto& rel : relations) {
14        adj[rel[0]].push_back(rel[1]);
        indegree[rel[1]]++;
    }

    queue<int> q;
    for (int i = 1; i <= n; ++i) {
        if (indegree[i] == 0) {
            q.push(i);
            dp[i] = time[i-1];
        }
    }

    while (!q.empty()) {
        int u = q.front(); q.pop();
        for (int v : adj[u]) {
            dp[v] = max(dp[v], dp[u] + time[v-1]);
            if (--indegree[v] == 0) {
                q.push(v);
            }
        }
    }

    return *max_element(dp.begin(), dp.end());
}

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 << minTime(n, relations, time) << endl;
    return 0;
}
```

```