1```javascript
2function minTime(n, relations, time) {
3    const indegree = new Array(n + 1).fill(0);
4    const adj = Array.from({ length: n + 1 }, () => []);
5    const dp = new Array(n + 1).fill(0);
6
7    for (const [u, v] of relations) {
8        adj[u].push(v);
9        indegree[v]++;

using System;
using System.Collections.Generic;

public class ParallelCoursesDFS {
    private static int DFS(int u, List<int>[] adj, int[] dp, int[] time) {
        if (dp[u] != 0) return dp[u];
        dp[u] = time[u - 1];
        foreach (var v in adj[u]) {
            dp[u] = Math.Max(dp[u], DFS(v, adj, dp, time) + time[u - 1]);
        }
        return dp[u];
    }

    public static int MinTimeDFS(int n, int[][] relations, int[] time) {
        List<int>[] adj = new List<int>[n + 1];
        for (int i = 0; i <= n; i++)
            adj[i] = new List<int>();

        foreach (var relation in relations)
            adj[relation[0]].Add(relation[1]);

        int[] dp = new int[n + 1];
        int maxTime = 0;
        for (int i = 1; i <= n; i++)
            maxTime = Math.Max(maxTime, DFS(i, adj, dp, time));

        return maxTime;
    }

    public static void Main() {
        int n = 5;
        int[][] relations = new int[][] { new int[] { 1,5 }, new int[] { 2,5 }, new int[] { 3,5 }, new int[] { 3,4 }, new int[] { 4,5 } };
        int[] time = new int[] { 1, 2, 3, 4, 5 };
        Console.WriteLine(MinTimeDFS(n, relations, time));
    }
}
```