3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2E5 + 5;
int n;
int size, head[maxn];
int root, sum[maxn], maxp[maxn];
int ans1;
bool vis[maxn];
long double ans2 = 1E18, w[maxn];
long double g[maxn];
struct edge {
  int to, next;
  long double w;
} E[maxn * 2];
inline void add(int u, int v, long double w) {
  E[++size].to = v;
  E[size].next = head[u];
  E[size].w = w;
  head[u] = size;
}
void findroot(int u, int F, int tot) {
  sum[u] = 1;
  maxp[u] = 0;
  for (int i = head[u]; i; i = E[i].next) {
    int v = E[i].to;
    if (v == F || vis[v]) continue;
    findroot(v, u, tot);
    sum[u] += sum[v];
    maxp[u] = max(maxp[u], sum[v]);
  }
  maxp[u] = max(maxp[u], tot - sum[u]);
  if (maxp[u] < maxp[root]) root = u;
}
void dfs(int u, int F, long double d, int source) {
  g[source] += w[u] * 1.5 * pow(d, 0.5);
  for (int i = head[u]; i; i = E[i].next) {
    int v = E[i].to;
    if (v == F || vis[v]) continue;
    dfs(v, u, d + E[i].w, source);
  }
}
long double get(int u, int F, long double d) {
  long double s = w[u] * pow(d, 1.5);
  for (int i = head[u]; i; i = E[i].next) {
    int v = E[i].to;
    if (v == F) continue;
    s += get(v, u, d + E[i].w);
  }
  return s;
}
void solve(int u) {
  vis[u] = 1;
  long double d = get(u, u, 0);
  if (d < ans2) ans1 = u, ans2 = d;
  long double tot = 0;
  for (int i = head[u]; i; i = E[i].next) {
    int v = E[i].to;
    if (vis[v]) continue;
    g[v] = 0;
    dfs(v, u, E[i].w, v);
    tot += g[v];
  }
  for (int i = head[u]; i; i = E[i].next) {
    int v = E[i].to;
    if (vis[v]) continue;
    if (tot - 2 * g[v] < 0) {
      root = 0;
      findroot(v, u, sum[v]);
      solve(root);
      break;
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> w[i];
  for (int i = 2; i <= n; ++i) {
    int x, y, z;
    cin >> x >> y >> z;
    add(x, y, z);
    add(y, x, z);
  }
  maxp[root = 0] = n + 1;
  findroot(1, 1, n);
  solve(root);
  cout << ans1 << " " << fixed << setprecision(9) << ans2 << endl;
  return 0;
}
